Write a simulator that compares between the following memory management algorithms: First Fit, Next Fit and Best Fit. The simulator will read the following file, which has the number of coming programs, the required pages for each program and the allocation program. Each program has a different allocation time Assume the total memory size is 20 pages and each program could ask for any number of page between 1 and 10 You need to print the memory after each change (ex. every 1 seconds) and the current system time (ex. a loop counte Compare about the above algorithms: average finished time for all jobs, average waiting time for all jobs and finished time for all jobs. Which algorithm is the best? r) The example of the input files. P1 P2 P3 P4 P5 P6 10 Example of output file: First Fit Timer Memory Pages 11111222333344444440 (1 means P1, 2 means F2 0 means free page) 11112000555000