Write a C++ -program that will implement Worst-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.