a) Given Static memory partitions shown in the following picture, Draw diagrams on [6+2] how would each of the first-fit, best-fit, worst-fit algorithms place processes with the space requirement of the processes - P1 (146 KB), P2(425 KB), P3(240 KB), P4(89 KB) and P5(450 KB) (in order). Which algorithm makes the most effective use of memory? Answer with justification. Memory Partitions: 200 KB 250 KB 450 KB 160 KB 320 KB 150 KB 600 KB