Question no 2: Assume that the main memory has the following 8 fixed partitions with the following sizes:600KB, 50KB, 350KB. 250KB, 450KB, 200KB, 500KB and 400KB (in order) a) How would each of the First-fit, Best-fit, next fit, Worst-fit algorithms place processes of 345KB, 25KB, 45KB, 200KB, 417KB, 535KB, 112KB and 440KB (in order)? b) Compute the total memory size that is not used for each algorithm. c) Which algorithm makes the efficient use of the memory