The following diagram shows an example of memory configuration under dynamic partitioning, after a number of placements and swapping-out operations have been carried out. Addresses go from left (0) to right (max); gray areas represent blocks occupied by a process while white areas show free memory blocks and their sizes. The last process placed is a 2MB shown marked as X. Only one process was swapped out after that. 4M 8M 2M 4M 3M a. What was the maximum size of the swapped out process? b, what was the size of the free block before it was partitioned to x? C. A new 3 MB allocation request must be satisfied next. Indicate the intervals of memory that will be used for each of the 4 placement algorithms: best-fit, first-fit, next- fit and worst-fit (you can underline in the drawing). The following diagram shows an example of memory configuration under dynamic partitioning, after a number of placements and swapping-out operations have been carried out. Addresses go from left (0) to right (max); gray areas represent blocks occupied by a process while white areas show free memory blocks and their sizes. The last process placed is a 2MB shown marked as X. Only one process was swapped out after that. 4M 8M 2M 4M 3M a. What was the maximum size of the swapped out process? b, what was the size of the free block before it was partitioned to x? C. A new 3 MB allocation request must be satisfied next. Indicate the intervals of memory that will be used for each of the 4 placement algorithms: best-fit, first-fit, next- fit and worst-fit (you can underline in the drawing)