Given memory partitions of 100KB,500KB,200KB,300KB and 600KB (in order). How would each of the first-fit, best-fit and worst-fit algorithms place processes of 212KB, 417KB,112KB and 426KB (in that order)? Solution: - First-Fit: - Best-fit - Worst-Fit: In above case, which algorithm makes the most efficient use of memory