Question $5.[6$ marks$]$

$5-$a$)[3$ marks$]$ Given eight memory holes of $10KB,4KB,20KB,18KB,7KB,9KB,12KB,$ and $15KB($in order$),$ how would the first$-$fit, best$-$fit, and worst$-$fit algorithms will place P$1($requires $12$KB$),$ P$2($requires $10KB),P3($requires $7$KB$)$ and P$4($requires $9$KB$).$ Use memory maps given below to answer the question.

First fit

$\backslash$table$[[10K,4K,20K,,18K,,7K,,9K,,12K,,15K$