1. ( 5 points: With 2 or more errors you get O points. Otherwise full point.) Fill in the empty cells of the following table. Assume that main memory size is 4GB. 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 FIFQ, LRU etc is needed (ves) or not (no). If some combinations are not possible mark them. Tag Size Index Word Bvte Size (Set No.) in Size in bits(Yes/No) bits Block Blockin bits CacheN No.Sizewa Block Offset Replacement Offset Size in |Policy Needed Word size cacheSize(no. of words) bits 256 256 256 256 512 10512 11512 32 bits 32 bits 32 bits 32 bits Full bits bits bits 16 12512 Full 16 bits lWord Block Offset Size in bits: Log2No. of words in a block) Byte Offset Size in bits: Log2(No. of bytes in a word)