1. Write a C program that

implements the First_in_First_out algorithm

the Least Recently Used algorithm.

First, generate a random string(15 numbers) that represents the pages (numbers range from 0 to 9). In each program apply the algorithm on the random string and you should output the number of page faults. You should read in a command line argument from the command line that represents the number of pages(should work for numbers between 1 and 8) Assume that demand paging is used.