This diagram shows an example of memory 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 blocks occupied by processes; white areas indicate free memory blocks. The last process placed is 2 MBytes and is marked with an X. Only one process was swapped after that. 4M 3M HH 4M 1 M 2 X 5M 8M M a. What is the maximum size of the swapped out process? b. What was the size of the free block just before it was partitioned by X? c. A new 3-MByte allocation request must be satisfied next. Indicate the intervals of memory where a partition will be created for the new process under the following four placement algorithms: best-fit, first-fit, next-fir, worst-fit. For each algorithm, draw a horizontal segment under the memory strip and label it clearly.