Consider the following sequence of memory references from a 475-word program: 16, 22, 180, 110, 87, 340, 175, 263, 240, 388, 375, 464, 498, 365 i. Determine the page reference string from the above memory reference sequence, assume that the page size is 90 word. [01 Marks] (Hint: first set the program memory (550 word) with page number using page size of 90 word as shown below. Page # Memory reference 0-89 ... 90-179 450-549 Once the memory reference is mapped with the page number replace the memory reference sequence with the page number to get the page reference string. i.e. page 0 will replace memory reference 16, page 0 will replace memory reference 22, page 1 will replace memory reference 175 etc. to produce reference string as shown below). Reference string Memory reference| 16 1 22 175 464 ... ii. For the obtained page reference string in part (a) calculate the number of page faults using Least Recently Used (LRU) and Optimal page replacement (OPT) algorithm having 3 frames in physical memory. [03 Marks] iii. What will be the effect on page fault rate if the number of frames is decreased to 2 frames? Explain. [01 Marks) Question No.8: Storage (Disk Management) (04 Marks) A disk contains total 200 tracks and Request Queue contains tracks 82, 170, 43, 140, 24, 16, 190. Apply FCFS and SCAN and find total track movements if head start position is at 50. Compare the results and Discuss which algorithm is better to apply?