Objectives: Learn how Worst-Fit algorithm work in memory management. Description: Write a C++ program that will implement Worst Fit Memory Management Algorithm. Your program must do the following: Input the memory size and the number and sizes of all the partitions (limit the max number of the partitions to 5) Input the job list that includes: 1. 2. lob's nae Job's size 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). Calculate and display initial memory allocation. Display the memory waste and the jobs that could not be allocated and have to wait. 3. 4. 5