Describe the three memory allocation algorithms covered in lectures. Given five memory partitions of $100KB,500KB,200KB,300KB,$ and $600KB($in order$),$ how would each of the first$-$fit, best$-$fit, and worst$-$fit algorithms place processes of $212KB,417KB,112KB,$ and $426KB($in order$)?$ Which algorithm makes the most efficient use of memory?