Name HW5: Virtual Memory and Storage Scheduling 1) Given a 3 frame VMM and the page request sequence below (it's the top row), perform the VMM First In First Out page replacement policy (complete the table) to determine the total number of page faults for the sequence F1 2 342 4 5 1 637 5 3 26 6 2 4 5 3 2151 6 34 2 1 How many page faults? 2) Given a 4 frame VMM and the page request sequence below (it's the top row), perform the VMM Least Recently Used page replacement policy (complete the table) to determine the total number of page faults for the sequence F1 2 34 24 51 637 53 26 6245 3 215 634 2 1 How many page faults? 3) Given a 3 frame VMM and the page request sequence below (it's the top row), perform the VMM Optimal page replacement policy (complete the table) to determine the total number of page faults for the F1 2 342 4 5 1637 5 3 26 6 2 4 5 3 2151 6 3 4 21 How many page faults