write a c++ program that displays how a (non-relocatable) Dynamic Partitioning Memory Management using First Fit allocation scheme works.

Your program must input:

a memory size M; and an arbitrary sequence of information indicating the history of traffic, in and out of the memory, pertaining to a number of jobs showing the initial loading of a jobs request of certain partition size, the temporary removal of a job, and possibly reloading of the job.

E.g. [(load, job5, 20k), . . . (remove, job 7) . . . (reload, job7) . . . etc.]

In the display it must show if a job is loaded successfully the first time, it should maintain the lo- cation of the partition. This is because, if the job is temporarily removed and to be brought back later, it has to go in the same location.

It must show the result after it checks if every item (generated at random) is valid eg. it must not have a removal of a job if the job is not already in memory etc.

Also, upon de-allocation of a job, neighboring free partitions must be col- lapsed into one bigger free partition;

and it must show snapshots of the memory, and corresponding allocation list and free list.