Given six memory partitions in a RAM of $300KB,600KB,350KB,200KB,750$

$KB,$ and $125KB($in order$)($This means that the total available Memory size $=$

$2375KB).$ How would the first$-$fit, best$-$fit, and worst$-$fit algorithms place processes of

size $115KB,500KB,358KB,200KB,$ and $375KB($in order$)?$ Show your drawing.