This is a programming assignment, please complete in either java or python, please.

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: Initial dynamic partitions for the dynamic memory allocation scheme: 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 figure: 2.3. : on page.i 35 Show the snapshots of the memory as you apply each of the corresponding allocation schemes. 2. For the fixed allocation scheme, create a spreadsheet similar to table 2.1 on page 32 showing the partition sizes, the memory address, the access sequence, and the partition status. 3. For the dynamic memory allocation scheme, create a spreadsheet similar to table 2.2. 4. 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: 5. Identify the job(s) that will not be able to reside in the memory and have to wait in each of the snapshots of the memory. 6. 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. (table 2.2) These two snapshots of memory show the status of each memory block before and after a request is made using the first-fit algorithm. (Note: All values are in decimal notation unless otherwise indicated.) (table 2.1) A simplified fixedpartition memory table with the free partition shaded. (figure 2.3) Main memory use during fixed partition allocation of Table 2.1. Job 3 must wait even though 70K of free space is available in Partition 1, where Job 1 only occupies 30K of the 10oK available. The jobs are allocated space on the basis of "first available partition of required size