Task 6. Total 5% Consider a paging system with the one-level page table stored in memory. (a) If a memory reference takes 10 ns (nanoseconds), how long does a paged memory reference take? (b) If we add TLBs, and if 90 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry in the TLBs takes 0.5 nanoseconds, if the entry is present.) Task 7. Total 5% Consider the page table for a system with 12-bit virtual and physical addresses and 256-byte pages, Page Number Frame Number 2 0 1 2 1 3 3 4 5 B 6 7 The list of free page frames is 4, 7, 6 (that is, 4 is at the head of the list, 7 is second, and 6 is last). A dash (-) for a page frame indicates that the page is not in memory. You can convert a virtual address to its physical address with this page. Eg, virtual address 2EF will be converted to 3EF. Convert the following sequence of virtual addresses (in hexadecimal) to their equivalent physical addresses. Indicate if there is a page fault. You can use a table to show your answers. 399, 5FE, 710, 110, 421