For this project we have to use these inputs (the second picture attached) and we should get the outputs that I attached.

Objective: Write a C++ -program that will implement 4 Memory Management algorithms A) Best-Fit B) First-Fit C) Next-Fit D) Worst-Fit Your program must do the followin 1. Program Input a. User will input to the program, Number of partitions, and Memory Sizes for each partition/partitions b. User will input the name for each process, and the amount of memory the process needs 2. For each algorithm, your program should have a data structure(class) that will include the job status (Run/Wait), and the partition number assigned to the job (if the job was allocated) You can create an array or list of the class to represent the job queue 3. Program output a. Calculate and display a list of initial memory allocation, i.e which partitions contain which process after the first round of allocation b. Program will calculate and display the memory waste for each partition. c. A list of Processes not assigned to any partitiorn