Describe the following allocation algorithms:
a. First fit
b. Best fit
c. Worst fit
a. First-fit: search the list of available memory and allocate the first block that is big enough.
b. Best-fit: search the whole list of available memory and allocate the smallest block that is big enough.
c. Worst-fit: search the whole list of available memory and allocate the largest block.