Contiguous Memory Allocation. The leftmost figure below shows the current memory usage. It has three available memory blocks, in the size of $300KB,100KB,$ and $370$ KB $,$ respectively $($in order$).$ Please use the $3$ figures at right side to show how the first$-$fit, best$-$fit, and worst$-$fit contiguous memory algorithms will place four new coming processes, P$3(212$ KB $),$ P$4(90$ KB $),$ P$5(80$ KB $),$ and P$6(326$ KB $)($in order$)$ in the memory, respectively? Please mark the size of new holes.

The memory map before P$3$ P$6$ coming

The memory map after P$36$ coming $($First$-$Fit Alg.$)$

The memory map after P$36$ coming $($Best$-$Fit Alg.$)$

The memory map after P$3-6$ coming $($Worst$-$Fit Alg.$)$