2. (8 points - Correctness) Cache Accesses: Bowser after conquering the mushroom kingdom finds Two caches in the computer room of the castle. These caches A and B have the following specs (they are really tiny caches): Cache A: 8 byte, 2-way set-associative cache with 2 byte block size. Cache B: 8 byte, fully associative cache with 2 byte block size. It receives memory requests to the below addresses(binary) in the given order: 0000, 1111, 0011, 0100, 0000, 0010, 1010, 1110, 0110, 1001, 1101, 0110 Assumptions: Both the caches are initially empty. The processor uses LRU as the replacement policy (a) What are the number of offset, index and tag bits for Cache A and Cache B? Use one sentence to explain your answer. (b) Fill out this table for a fully associative cache (cache B). In each column, indicate whether the miss is Compulsory ("C") or Capacity ("A"). and put the tag value in the cell. We filled out the first two columns for you. 6 set accesso 0000 1 2 1111 0011 3 4 5 0100 0000 0010 7 1110 8 9 01101001 10 1101 11 0110 0 000 (C) 1 111 (C) 2 3 CSE 141: Introduction to Computer Architecture Winter 2021 (c) Fill out this table for a set associative cache (cache A). In each column, indicate whether the miss is Compulsory ("C") or Capacity ("A") or Conflict ("F"() and put the tag value in the cell. We filled out the first three columns for you. In each cell, indicate the LRU tag by underlining it. In this case, the 11/00 indicates 11 is the LRU one. set 0 1 00001111 2 0011 3 0100 4 0000 5 0010 6 1010 1110 7 1110 8 0110 9 1001 10 1101 11 0110 0 00/- (C) 1 11/-- (C) 11/00 (C)