help please !

3. Multiprogramming with Dynamic Partitions: memory is treated as one large contiguous space. Main memory consists of 64 units. Process requests arrive in the following order: P, requests 10 memory units memory units requests 16 P, requests 29 memory units P4 requests 8 memory units Show what memory contiguous memory allocation methods. Determine the first and last addresses of programs in each partition and calculate the total fragmentation. looks like when using the following First Address belonging to P Last Address belonging to P First Address belonging to P2 Last Address belonging to P2 First Address belonging to P3 Last Address belonging to P3 First Address belonging to P Last Address belonging to P4 Total Fragmentation Observations? See Algorithms in Appendix A pp. 533-535 (edition 7 pp. 521 523) hat does memory look like after the following has Problem: W happened? P2 completes Ps requests 8 memory units P, completes P, completes