Assume an OS has five free memory partitions of 100KB, 500KB, 200KB, 300KB and 600KB: free P10 free P11 free P12 free P13 free 100KB 30KB 500KB30KB200KB30KB300KB30KB 600KB The OS needs to place 4 new processes in memory in the following order: P1 of 212KB, P2 of 417KB, P3 of 112KB and P4 of 426KB. Draw the diagrams of the partitions after the OS has placed the processes using 4 different algorithms: first-fit, best-fit, worst-fit and next fit. The resulting diagrams must show the size of each partition, and the status of each partition, similar to the figure above. If a process cannot be placed, indicate that below the diagram. Please start the placement algorithms from the first partition