Question 4 (a) [Q4-1: Given five memory partitions of 150 Kb, 450 Kb, 220 Kb, 300 Kb, and 550 Kb (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 250 Kb, 450 Kb, and 100 Kb and 500Kb (in order).]

Question 4 (a) [Q4-1: Given five memory partitions of 150 Kb, 450 Kb, 220 Kb, 300 Kb, and 550 Kb (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 250 Kb, 450 Kb, and 100 Kb and 500Kb (in order).] - si-manual