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$.$

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 $($BF$),$ first$-$fit $($FF$),$ next$-$fit $($NF$),$ and worst$-$fit $($WF$).$ Drag the abbreviation for each algorithm to the partition where it would place the new request. Drag an X to all unused partitions.