can you answer #6

Say the currently running process has 16 active pages, P0-P15, all of which have their reference bits set to 1. If the operating system uses the clock algorithm for page replacement, the pages are ordered numerically around the clock" (P0 is first, P1 is second, etc), and the "clock hand" currently points to P6, which page will be replaced if a frame is needed to bring in a new page? Explain your answer for full credit. A portion of the currently running process's page table is shown below. Assume the system uses 20-bit addresses and 16 KB pages. The process accesses four addresses: 0x25FEE, 0x2B149, 0x30ABC, and 0x 3170F. Determine (i) which address would cause a page to be evicted if there were no free physical frames, (ii) which one would mark a previously clean page as modified, if the access were a write, and (iii) which one accesses a page that has not been referenced for many cycles. For full credits, show all work