4. Given five memory partitions of 10KB,5KB,30KB,25KB, and 40KB (in same order), how would the first-fit and best-fit algorithms place processes mentioned in table below. Assume that all processes arrive at the same time and the processes will loaded on memory inorder A,B,C,D 5. Given 6 memory partitions of 300KB,400KB,350KB,200KB,250KB and 125KB ( in order). how would the first - fit, best - fit and worst - fit algorithms place processes of size 115KB,350 KB,158KB,200KB and 275KB ( in order)