Please help. Thank you very much

Programming Assignment .2 CSIS4251 Apply both fixed and dynamic memory allocation schemes. Use a memory size of X for the fixed partitioning scheme, and Y for the dynamic partitioning scheme. Assume a starting address of Z, and initial job size and partition sizes with the following format: Initial fixed partitions size for the fixed memory allocation scheme: N Partitions of size M each Job Sizes Memory Requirement Job 1 Job 2 Job 3 numberl number2 number3 Initial dynamic partitions for the dynamic memory allocation scheme: Partition 1 Partition 2 Partition 3 number 1 number 2 number 3 Calculate the amount of fragmentation using the fixed and dynamic memory allocation schemes using First-Fit, Best-Fit, NEXT-Fit, and Worst-Fit methods. Your program should show the following steps: 1. Similar to figures 2.3& 2-7on pages 36and 37 show the snapshots of the memory as you apply 2. 3. For the dynamic memory allocation scheme, create a spreadsheet similar to table 2.2. each of the corresponding allocation schemes. For the fixed alloction scheme, create a spreadsheet similar to table 2.1 on page 35 showing the the memory address, the access sequence, and the partition status. Calculate the total fragmentation and show snapshots of the memory after completion of the jobs assuming the following format for a sequence of events which show arrival and departure of various jobs such as: 4. Job 1 arrives Job 2 arrives Job 3 arrives Job 1 leaves Job 4 arrives Job 3 leaves 5. Identify the jobo) that will not be able to reside in the memory and bave to wait in each of the snapshots of the memory Repeat steps 1 through 5 for the modified algorithm that your team has worked on and show its effectiveness through some analysis of the results. 6