Use three different memory allocation schene i.e. best-fit, next-fit and first-fit in order to manage menory allocation for the following jobs in Table 1 Discuss the advantages and disadvantages of each scheme and justify which is the best scheme. Table 1 1. Write a program that will simulate the process an operating system follows when cycling jobs to make sure they are all completed quickly in C or C++. 2. Copy the data in Table 1 from the prompt into a text file that you can use as input for a program. 3. Write a program using C or C++ that can take the input from your text file. 4. In the same program, write a function that will queve up each job along with its start. time, job size, execution interval, and state at the end of each interval. 5. Continue building on this program so that you can execute each of these jobs according to their individual interval. 6. Have this program return the state of each job at the end of each interval. 7. Run the program until all jobs are complete