Example: A set of $32-$bit memory address references as well as memory contents are given below. Find the tag, index, offset bits and hit$/$miss $($HIT$/$MISS$)$ status of these addresses. If the cache is initially empty, determine the final cache contents after these address references are processed in order. The four$-$word block cache with a total of $48$ words has a three$-$way set associative structure. Find out what the hit rate is when the least recently used $($LRU$)$ replacement principle is used. Show all the steps taken in the cache structure.