Assuming that the processes arrived in the following sequence: Process A, Process B, Process C, Process D and Process E. Answer the following questions:

i) Explain the implementation of the Worst Fit algorithm.

ii) Use the Worst Fit algorithm to allocate the memory blocks to the arriving processes.

iii) State ONE (1) advantage of the Worst Fit algorithm.

(12 marks)

List of Size Memory Size processes block Process A 550K Block 1 550K Process B 30K Block 2 800K Process C 100K Block 3 400K Process D 750K Block 4 200K Process E 650K Block 5 710K Block 6 250K Figure 1: List of processes and memory clocks on a computer system