NMJ42503 MODERN OPERATING SYSTEM ASSIGNMENT 3 Updated This assignment is under Chapter 7 Memory Management. Please submit this assignment on Friday, 13 the January 2023. Use three different memory allocation scheme i.e. best-fit, next-fit and first-fit in order to manage memory allocation for the following jobs in Table 1. Consider that the total memory size is 20Kb. The blocks sizes are 3Kb,5Kb,6Kb,2Kb and 4Kb. I. 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 queue 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 retum the stataon foach iahat the endlof each interval. 2. Cep; the data in Table. I from the prompt into a text file that you can ure as inp 61 a jrogram. 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 queue 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. 8. Discuss the advantages and disadvantages of each scheme and justify which is the best scheme