4. [20 points] Consider a direct-mapped Ll cache that has only two sets. Memory blocks A, B, C and D all map to the same set in the L1 cache. The processor issues read requests to memory blocks A, B, C and D in the following sequence A B B A C B C D A a. [10 points] Below each memory block reference, select only one of the four scenarios hit, compulsory miss, capacity miss, or conflict miss. (Show all your work, including all caches needed to differentiate the type of miss.) A. A. Hit Compulsony miss Capacity miss Conflict miss b. [5 points] Suppose the L1 cache is augmented with a victim cache that can hold one memory block. How many read requests will be issued to the L2 cache? (Show your Wor # of L2 reads c. [5 points] Suppose the LI cache is augmented with a victim cache that can hold N memory blocks (the victim cache uses the LRU replacement policy if N>I). What is the minimum N needed to minimize the number of L2 reads? What is the minimum number of L2 reads that is possible? (Show your work.) minimum N needed to minimize the number of L2 reads minimum # of L2 reads that i possible 4. [20 points] Consider a direct-mapped Ll cache that has only two sets. Memory blocks A, B, C and D all map to the same set in the L1 cache. The processor issues read requests to memory blocks A, B, C and D in the following sequence A B B A C B C D A a. [10 points] Below each memory block reference, select only one of the four scenarios hit, compulsory miss, capacity miss, or conflict miss. (Show all your work, including all caches needed to differentiate the type of miss.) A. A. Hit Compulsony miss Capacity miss Conflict miss b. [5 points] Suppose the L1 cache is augmented with a victim cache that can hold one memory block. How many read requests will be issued to the L2 cache? (Show your Wor # of L2 reads c. [5 points] Suppose the LI cache is augmented with a victim cache that can hold N memory blocks (the victim cache uses the LRU replacement policy if N>I). What is the minimum N needed to minimize the number of L2 reads? What is the minimum number of L2 reads that is possible? (Show your work.) minimum N needed to minimize the number of L2 reads minimum # of L2 reads that i possible