Write a Python program for (non-relocatable) Dynamic Partitioning Memory Management using First Fit allocation scheme.,

Your program will 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 (i) initial loading of a jobs request of certain partition size, (ii) temporary removal of a job, and (iii) possibly reloading of the job. E.g. [(load, job5, 20k), . . . (remove, job 7) . . . (reload, job7) . . . etc.]

Your software should at least do the following:

1. 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. 2. check 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.

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

4. show snapshots of the memory, and 5. corresponding allocation list and free list.