https//elearn squ.edu.om/plugin file.php/230642/mod resource/content/i/Hw 5. (6 points) Consider a paging system with the page table stored in memory. i. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take? ii. If we add TLB (Translation Look-aside Table) with access time 10 nanoseconds, and 75% of all page-table references are found in the TLB, what is the effective memory reference time? 6. (6 points) Given the following page reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2 Find the number of page faults for a 4 frame memory using each of the following page replacement algorithms indicated below. Note You must show details of how you got our answers a. FIFO b. LRU c. Optimal