In C Program

1 1. Page Replacement Algorithm: FIFO Design a program using first in first out page algorithm with the following requirements: Use any programming language of your choice Should ask the user for the total number of reference string (min of 10, max of 20) Page frame is fixed to 3 Produces a text-based info of frames per iteration Computes the number of page fault Input 1. Total number of reference string 2. Reference string Output Total number of page faults Expected Output Enter the number of reference string: 12 Enter the reference string: 1 2 3 4 1 2 5 1 2 3 4 5 Iteration 1: 1 F1: 1 F2: null F3: null Page fault: 1 Iteration 2: 2 F1: 1 F2: 2 F3: null Page fault: 2 Iteration 3: 3 F1: 1 F2: 2 F3: 3 Page fault: 3 Iteration 4: 4 F1: 4 F2: 2 F3: 3 Page fault: 4 Iteration 5: 1 Iteration 6: 2 F1: 4 F2: 1 F3: 2 Page fault: 6 Iteration 7: 5 F1: 5 F2:1 F3:2 Page fault: 7 Iteration 8: 1 F1: 5 F2: 1 F3:2 No page fault Iteration 9: 2 F1: 5 F2: 1 F3: 2 No page fault Iteration 10: 3 F1: 5 F2: 3 F3: 2 Page fault: 8 est Cases Executions Iteration 10: 3 F1: 5 F2: 3 F3: 2 Page fault: 8 Iteration 11: 4 F1: 5 F2: 3 F3: 4 Page fault: 9 Iteration 12: 5 F1: 5 F2: 3 F3: 4 No page fault Total number of page fault: 9 Teercase2 Expected Output Enter the number of reference string: 21 Invalid input! Test Case 3 Timed Out 3 Test Case 4 Timed Out Test Case 5 Expected Output Enter the number of reference string: 9 Invalid input! Test Case 4 TIME DE 3 Test Case 5 Execute Code Expected Output Enter the number of reference string: 100 Invalid input! Test Case 5 Execute Code Expected Output Enter the number of reference string: -1 Invalid input! Execute Code