Given six memory partitions of $30$ KB$,60$ KB$,85$ KB$,20$ KB$,75$ KB$,$ and $115$ KB $($in order$),$ and processes of size $25$ KB$,50$ KB$,35$ KB$,15$ KB$,$ and $40$ KB $($in order$)?$

a$)$ Determine how would the first$-$fit, best$-$fit, and worst$-$fit algorithms place those processes

b$)$ Determine the efficiency of using the memory for each of the algorithms.