5. Topic 8: Virtual Memory introduced a few page replacement algorithms with the use of which the operating system can decide which "victim" page to choose for replacement. A certain computer has space for 4 frames in main memory. Suppose that a process that has 8 logical memory pages (numbered 0 to 7 ) starts running on the CPU of this computer, and that the pages that it uses (reference string) are the following, from left to right: Given that the operating system uses the Least Recently Used (LRU) page replacement algorithm, what pages will be in memory after each one of the page requests was processed by the operating system? Show the content of the main memory in each stage in the format that the example below shows; you don't need to provide an explanation. Example from slide 32: If the reference string were then the content of memory would have looked as follows after each page was processed: (a) After page 7 is processed: 17ll l. (b) After page 0 is processed: 7 (c) After page 1 is processed: 71 (d) After page 2 is processed: 71 l. (e) After page 3 is processed: 12. (f) After page 0 is processed: 012. (g) After page 7 is processed: 072. (h) After page 3 is processed: 072