Question $7$:

$(5$ Marks$)$

CO$3$ Consider a scenario where you are given memory partitions of $160K,500K,200K,$

$330$ K $,$ and $600$ K $($in order$)$ and processes arriving in sequence: $2x2K,4x7K,$

$1$ X $2$ K $,$ and $4$ X $6$ K $.[$Note: Replace $\text{'}$ X $\text{'}$ in each process size with the last four digits

of your ULAB ID$.$ For example, if your student ID is $121413091,$ the processes

will be $232K,407K,192K,$ and $416$ K $.]$

You are required to apply at least four memory allocation algorithms$-$First Fit,

Best Fit, Worst Fit, and Next Fit$-$to dynamically allocate the memory partitions

for the processes in a contiguous manner. Finally, compare the performance of

these algorithms by calculating the fragmentation that occurs in each case.