Here is a series of addresses in hexadecimal: 20(w), 3c(r), 10(r), 16(w), 20(r), 04(w), 28(r), 6(r), 10(w), 17(w)assume a lru replacement algorithm. for the four caches in problem 1, draw each cache as it would appear at the end of the series of references. include the valid bit, dirty bit, and tag. show the contents of the memory block using the byte address range such as m[20-23] for the word with address 22.here is problem 1 for reference. i need some with part d (cache d) in reference to the question above ( i have already solved question 1.1. there are 4 caches with the organization and block size as indicated below. all caches hold 128 words where each word is 4 bytes. assuming a 32-bit address. a. a direct-mapped cache with block size of 16 wordsb. 2-way set-associative cache with block size of 8 words c. 4-way set-associative cache with block size of 4 words d. a fully associative cache with block size of 32 words.