application will run faster if its missing less in the cache because missing the cache is slow due to the long "walk" to the main memory to get the data and back. To evaluate how much faster will the application run, we look at average number of cycles for memory access and compute the average memory access time $($AMAT$).$ For the memory accesses illustrated in Fig $3.$ calculate the ama of a memory access takes $1$ cycle $($hit or miss$)$ and the penalty of going to main memory takes $3$ cycles