(Solved) : 1 Given References Following Pages Program 0 1 4 2 0 2 6 5 1 2 3 2 1 2 6 2 1 4 6 2 Many Pa Q29778331 . . . .

1. Given references to the following pages by a program, 0, 1,4, 2, 0, 2, 6, 5, 1, 2, 3, 2, 1, 2, 6, 2, 1, 4, 6, 2, how many pagefaults will occur if the program has three-page frames available toit and uses: (a) FIFO replacement? (b) LRU replacement? (c) Optimalreplacement? Show clearly how you got your results. Repeat thethree algorithms for the scenario when the process has beenallocated four frames. [2x2x3 points]

2. A memory manager has 116 free frames and it is requested by fourprocesses with these memory requests – A (spanning 40 pages), B (20pages), C (48