The following indicates a part of memory, available for allocation. The memory is divided into segments of fixed sizes of the following sizes.

$10$ KB $5$ KB $20$ KB $18$ KB $6$ KB $9$ KB $12$ KB $15$KB

Three processes A$,$ B$,$ and C with the respective sizes of $15$ KB$,10$ KB and $11$ KB are to be allocated successively. $(5$ marks$)$

Draw the results of the allocation when the following allocation methods are used:

first fit

best fit

worst fit

next fit

Which algorithm makes the best use of memory space?