Given five memory partitions of $200$K$,400$K$,600$K$,800$K$,$ and $900$K $($in order$),$ write how would each of the First$-$fit, Best$-$fit, and Worst$-$fit algorithms place processes of $418$K$,519$K$,232$K$,$ and $640$K$,324$K $($in order$)?$ Then, write which of these algorithms makes the most efficient use of memory and illustrate why.