Q3) (30 points) Below a page reference string is given. Initially we have an empty memory of 3-bins. 1, 3, 2, 5, 3, 2, 1, 4, 6, 5, 4, 2, 1, 2, 3, 2, 6, 3, 2, 1, 2, 3, 6, 4, 1, 5. 9 9 This time 2 new algorithms is given: Most-Frequently Used (MRU) selects the opposite of LRU, and Non-Optimal (NO) performs a future check and performs the opposite of Optimal algorithm. a Find the number of page-faults for MRU and NO algorithms