Suppose that we have main memory using the Clock replacement algorithm and One-Block-Lookahead (OBL) prefetching scheme. OBL prefetching is also known as prefetch-on-a miss because virtual page i+1 is prefetched when we have a page fault on virtual page i. We assume that 4page frames are allocated to a process, and the process references its virtual pages in the following order: 3, 4, 6, 5, 7, 4, 8. Illustrate the change in the circular queue for each reference, and clearly describe how the Clock and OBL prefetching work together for each reference (to make the change in the circular queue). Suppose that we have main memory using the Clock replacement algorithm and One-Block-Lookahead (OBL) prefetching scheme. OBL prefetching is also known as prefetch-on-a miss because virtual page i+1 is prefetched when we have a page fault on virtual page i. We assume that 4page frames are allocated to a process, and the process references its virtual pages in the following order: 3, 4, 6, 5, 7, 4, 8. Illustrate the change in the circular queue for each reference, and clearly describe how the Clock and OBL prefetching work together for each reference (to make the change in the circular queue)