pls show me the steps how

To do it? Thanks!

2. (15 points) For the cache/memory from part #1, the access time for the cache is 7ns and the time required to fill a cache slot from main memory is 50ns. (This time allows us to determine the block is missing and bring it into cache.) Assume a request is always started in parallel to both cache and to main memory (so if it is not found in cache, we do not have to add this cache search time to the memory access). If a block is missing from cache, the entire block is brought into the cache and th access is restarted. You should assume the cache is initially empty. Show your work including the contents of the cache For each of the following assume you have a program that is stored in memory from locations 0 to 43. The program order of execution is 0-31.0-3, 32 to 43.0-3. and 32 to 43 a) Using a direct mapped cache, compute the hit ratio and Effective Access Time (EAT) for the program order of execution described above. b) Using a 2-way Set Associative cache, compute the hit ratio and Efective Access Time (EAD for the program order of execution described above using a Least Recently Used (LRU replacement policy. Note: 2-way refers to the number of blocks in a set c) Using a 2-way Set Associative cache, compute the hit ratio and Effective Access Time (EAD using a First In First Out FIFO) replacement policy. 2. (15 points) For the cache/memory from part #1, the access time for the cache is 7ns and the time required to fill a cache slot from main memory is 50ns. (This time allows us to determine the block is missing and bring it into cache.) Assume a request is always started in parallel to both cache and to main memory (so if it is not found in cache, we do not have to add this cache search time to the memory access). If a block is missing from cache, the entire block is brought into the cache and th access is restarted. You should assume the cache is initially empty. Show your work including the contents of the cache For each of the following assume you have a program that is stored in memory from locations 0 to 43. The program order of execution is 0-31.0-3, 32 to 43.0-3. and 32 to 43 a) Using a direct mapped cache, compute the hit ratio and Effective Access Time (EAT) for the program order of execution described above. b) Using a 2-way Set Associative cache, compute the hit ratio and Efective Access Time (EAD for the program order of execution described above using a Least Recently Used (LRU replacement policy. Note: 2-way refers to the number of blocks in a set c) Using a 2-way Set Associative cache, compute the hit ratio and Effective Access Time (EAD using a First In First Out FIFO) replacement policy