Question 5: (7 marks) Based on Chapter 9, consider the following memory partitions of 300 KB, 200 KB, 600 KB, 200 and 400 KB (in order), and processes of 112 KB, 390 KB, 500 KB, and 250 KB (in order). a) How would each of the first-fit, best-fit, and worst-fit algorithms place the above processes in the given memory partitions. Use the below representation of the memory partitions and fill it for every algorithm. (6 marks) Memory Process Partition 300 200 600 200 400 b) Which algorithm makes the most efficient use of memory? (1 marks)