Question 15 (5 points)
Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), an
allocation algorithm was used to place processes of 212K, 417K, 112K, and 426K (in
order). The placement was as follows:
212K is put in 500K partition
417K is put in 600K partition
112K is put in 288K partition (500k - 212k)
426K must wait
Which algorithm was it?
First-fit
Best-fit
Worst-fit