Please note when we are reading and when we are writing.

For this question, we assume a write-back and write-allocate cache with 16 bytes long cache blocks (cache block size - 16 bytes). The following sequence is repeated N times (that is total 6*N accesses) 1. READ Ox04CF 2. READ OxF3C7 3. WRITE 0x0423 4. WRITE 0x0433 5. WRITE 0x2BC4 6. READ 0x04BF Assume that the cache is empty initially and the entire block is fetched on a miss. I. What is the total number of misses (read misses plus write misses) for a direct- mapped cache of size 64 bytes? Il. What is the total number of "writebacks" of dirty blocks for the same cache in (1)? Dirty blocks are the cache blocks which have been updated in the cache but the updated value has not been propagated to the memory. Dirty blocks exist only under the 'write-back" policy III. Find the smallest size for a direct-mapped cache such that there are no misses besides compulsory misses*. IV. Find the smallest size for a 2-way set associative cache such that there are no misses besides compulsory misses*. Compulsory miss: the "very first" reference to a memory block results in miss. This miss is often referred as compulsory miss