3. This diagram shows an example of memory.r configuration under dynamic partitioning, after a number of placement and swapping-out operations have been carried out Addresses go from left to right; gray areas indicate hlocks occupied by processes; white areas indicate free memory blocks. The last process placed is Z-Mhyte and is marked with an X. Illllllll- a) What was the size of the free block just before it was partitioned by K? h) A new 3-Mbyte allocation request must be satisfied nest. Indicate the intervals of memory where a partition will he created for the new process under the following three placement algorithms: best-fit, first-t, and worst-fit