18. This problem is about what can be done when a process is larger than physical memory, that is, a process has more virtual pages than there are physical page frames. Assume that a process has four pages (numbered 0,1,2,3) in its virtual address space but the computer has only three physical page frames (numbered 0,1,2). The following diagrams show two possible sequences of referenced virtual page numbers by the running process. Write down in the empty slots below each page reference the virtual page that is loaded into each of the physical page frames just after the page reference (in other words, what does the process 's page table look like just after each page reference?Also, write down the total number of page hits and misses. Use the "Leased Recently Used"(LRU) page replacement policy in both cases, so you replace the contents of the page frame that was used the farthest back in time. Page Referenced: 0 23 02 Page Frame 0: Page Frame 1: Page Frame 2: # of hits- # of misses Page Referenced: 0 10 2 3 2 Page Frame 0: Page Frame 1: Page Frame 2: # of hits # of misses