Assume we are dealing with a system that places processes in…

Assume we are dealing with a system that places processes in memory following a dynamic partitioning scheme. At some point in time we have just loaded a process that needs 42 KB of memory. Memory space is as depicted below. Shaded regions are full, blanks are holes (with sizes in Kbytes as indicated). The darkly shaded region (black) is the process most recently loaded. Indicate where a new process requiring 42Kb of memory will be positioned if the placement policy is: (Responses may be used more than once)1. Best-fit, 2. First-fit, 3. Worst-fit,4. Next·fit.Each placement is independent of the others.