3. Given five memory partitions of 100k,500k,200k,300k, and 600k (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212k,417k,112k, and 412k (in order)? Which algorithm makes the most efficient use of memory (in this case)