b) Solve/Briefly discuss: 1) Suppose five memory partitions of 200 KB, 600 KB, 300 KB, 400 KB, and 700 KB (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place...

b) Solve/Briefly discuss:

1) Suppose five memory partitions of 200 KB, 600 KB, 300 KB, 400 KB, and 700 KB (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes
of 315 KB, 520 KB, 115 KB, and 430 KB (in order)? Which algorithm makes the most efficient use of memory?
2) Compare the First fit and Best fit partition allocation with reference to Memory Management.
3) What should be the optimal size of a page/frame