3. Replacement algorithm is the selection of a page in main memory to be replaced and swapped to virtual memory. The algorithm are Optimal, Least Recently Used (LRU), First-In-First-Out (FIFO) and Clock. If a process contains six virtual pages on disk and is assigned a fixed allocation of three page frames in main memory and the following page trace occurs: 1 2 2 0 2 1 2 3 5 4 2 5 3 0 3 5 4 1 4 5 2 3 5 4 3 Show the successive pages residing in the three frames using LRU and count the hit ratio. (10 marks)