Consider a fully associative cache with8 cache blocks (0-7). The memory block requests are in the order-5, 9, 27, 7, 17, 4, 27, 7, 13, 32, 44, 20, 7, 9, 13, 27, 11Illustrate the mapping process each memory block in the fully associative cache (alongwith hit/miss). If LRU replacement policy is used, which memory blocks will not be in the cache at the end of the sequence?Also, compute the hit ratio and miss ratio.