Consider a very small 2-way set-associative cache with a total of 2 sets and a block size of 16 bytes. The cache uses an LRU replacement policy. Assume that the cache is initially empty. The CPU access the following memory locations, in that order: c88H, 774H, 79cH, c00H, 784H, c80H, 718H, 738H, 770H, 774H. All addresses are byte addresses. No random order is considered,
The total number of pafe replacement in the overall operation will be
a. 0
b. 1
c. 2
d. 3
The answer is given option (c). Please explain.