A system has an 1024KB block of memory available as shown below. Processes Pl and P2 have already been in memory when processes P3(75KB), P4(210KB), P5(120KB), P6(55KB) and P7(119KB) arrive in this P3, P4, P5, P6 and P7 arrive. How these processes placement algorithms: (i) first fit, (ii) next fit, (ii) best fit, (iv) worst fit. If a process cannot be placed into memory, label it as out of memory order. Assume that P2 is the last process loaded into memory before would be placed in memory by the following Process Memory Area Size 1-100 101-160 161-400 401-530 531-700 701-780 781-905 906-1024 100 60 240 130 170 80 125 119 P1 P2 ext fit First fit Process Memory Area Size KB Process Memory Area Size KB Worst fit rocess Memory Area Size[KB Process Memory Area Size KB