Given six memory holes of $540$ KB$,620$ KB$,220$ KB$,110$ KB$,120$ KB$,$ and $250$ KB $($in order$),$ how would the first$-$fit, best$-$fit, and worst$-$fit algorithms place processes of size $100$ KB$,175$ KB$,450$ KB$,$ and $370$ KB $($in order$)?$