Given six memory partitions of 300 kb(m1), 600 kb(m2), 350 kb (m3), 200 kb (m4), 750 kb(m5), and 125 kb(m6) (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size p1-115 kb, p2- 500 kb, p3- 358 kb, p4 -200 kb, and p5 - 375 kb (in order)? rank the algorithms in terms of how efficiently they use memory.