(no. of 1. (5 points: With 3 or more errors you get 0 points. Otherwise full point.) Fill in the empty cells of the following table. Assume that main memory size is 0.5 GB. Index Size: No. of bits needed to express the set number in an address, Block Offset: No. of bits needed to indicate the word offset in a block, Byte Offset: No. of bits needed to indicate the byte offset in a word. Block Replacement Policy Needed: Indicate if a block replacement policy such as FIFO, LRU, LFU (Least Frequently Used) etc. is needed (yes) or not (no). If some combinations are not possible mark them. No. Tag Index Word Byte Block Block Cache N Word of Size Size Block Offset Replacement size No. Size way Size in Sets in (Set Offset Size in Policy Needed KB cache bits bits words) No.) in Size in bits (Yes/No) bits bits' 1 4 1 32 4 2 4 2 32 4 3 4 4 32 8 4 4 Full 32 8 9 32 1 16 4 10 32 2 16 4 11 32 4 8 16 12 32 Full 8 16 Word Block Offset Size in bits: Log2 (No. of words in a block) 2 Byte Offset Size in bits: Log (No. of bytes in a word)