2. (12 points) A certain small computer system uses paging to implement virtual memory. On this system t size is 256 bytes, each virtual memory is 2048 bytes and the actual memory available for user programs is 1024 bytes. The current page table for a particular process is: he page Page #In memory? Frame number No Yes No Yes No Yes No 0. (2 points) What virtual address maps to the actual address 234 (hex)? (4 points) Consider the four virtual addresses in the following table. For each one, indicate if referencing that address causes a page fault and, if it does not, which actual address it maps to. (b) Virtual Address (hex) Page fault? Actual address (if applicable) 456 301 765 267 (6 points) Here is a trace of page references and frame contents (the configuration of (a) is the current one (c) Time t = 012 3 456 789 10 Page Reference 4 2 4 646 0 6 0 20 Frame 0 Frame 1 Frame 2 6 | 6 | 6 16 16161616 Frame 3 Suppose that at time t-11 page 3 is requested. Fill in the following table showing which page would be overwritten if the given page-turning algorithm is used Page-turning algorithm Least-recently Used Least-Frequently Used First-in First-out Page overwritten