3.2. In a scenario of Dynamic Partitioning, we have a main memory with size of 128MB. We have 6 processes to be placed in memory, and they have the following sizes: P1(20MB), P2(14MB), P3(32MB), P4(10MB), P5(16MB), and P6(24MB). These processes might come in (IN) the memory and may leave the memory (OUT) from time to time, showing the following ordering of IN and OUT into memory (assuming an empty memory at start): P1(IN), P2(IN), P4(IN), P1(OUT), P3(IN), P5(IN), P3(OUT), P1(IN), P2(OUT), P4(OUT), P3(IN). Depending on the placement policy used by the system, we may have different memory usage layouts at the end of the given placement sequence. For any policy, the dynamic partitioning will waste memory space cause by an inherent issue on its design. [15] (i) Explain this inherent issue and how it affects memory management efficiency. (ii) What is Memory Compaction? Does it solve the problem? (iii) Following each of the Dynamic Partitioning Placement Algorithms (Best-fit, First-fit, and Next-fit), give the memory layout upon applying them to fulfill the provided IN/OUT memory sequence