could you please answer part D and E:

(15pts) Answer the questions below based on the page mappings shown below. Note that this is a logical representation of the contents of multiple page tables. Assume 4K pages. Page and frame numbers are in decimal format. Process # Page # Frame # Ref Bit Dirty Bit Perms 2 8 11 1 0 r 1 5 7 1 1 rw 3 9 6 0 1 rw 1 11 18 0 1 rw 3 8 10 1 0 2 2 32 1 1 2 9 19 0 1 rw 1 20 1 0 rx (a) (3pts) What physical memory address is accessed when process 1 accesses the virtual address Oxb321? rx r 12 (b) (3pts) Suppose one of the processes references a page that causes a page replacement to be initiated. Using the clock algorithm, starting at the top of the list (clock index is at top of list), which page table entry (page and frame) would be replaced? (c) (3pts) Write the resulting page table entry for the new page assuming that process 3 performed a read operation at address 0x1511f to cause the replacement (minimal page per- missions for the operation)? (d) (3pts) Suppose that process 3 tries to write at address 0x2220. What will be the result of this operation? (e) (3pts) Suppose that a process consumes 4MB of virtual memory and has a maximum working set size of 2MB. Further, suppose that the process runs on a system with a two-level page table using 8 bits for the page directory and 12 bits for addressing the page table entries. What is the minimal amount of page table memory needed by the process, assuming 10 bytes per entry