Write a C++ -program that will implement First-fit, memory management algorithms. Your program must do the following:

1. Input the memory size and the number and sizes of all the partitions (limit the max number of the partitions to 5);

2. Input the job list that includes:

- Job's name;

- Job's size.

3. For each job you should create in your program a data structure that will include the job status (Run/Wait) and the partition number (if the job was allocated);

4. Calculate and display initial memory allocation.

Display the memory waste and the jobs that could not be allocated and have to wait.

Hand in: A listing of your source program (with comments).

*** I have seen the correct code to this assignment posted. However, the code contains a static array that causes errors. Picture posted below, **

cinno of_partitions; int size_of_partition[max_partitions 1]; cout> job_data[i].j_size; int f = 0; // checking whether given job is allocated or not for (int j-1; j