Operating System:

4. Assume you have a dynamic memory partitioning scheme. Assume that 8 processes with given sizes have come along so far and have been placed in memory in the following way: P1 - 1MB, 4MB gap, P2 - 2MB, 1MB gap, P3 - 2MB, 5MB gap, P4 - 1MB, 8MB gap, P5 - 2MB, 2MB gap, P6 - 1MB, 4MB gap, P7 - 2MB, 3MB gap, P8 - 5MB. Then assume that five more processes of the following sizes appear and must be placed into memory: P9 - 1MB, P10 - 7MB, P11 - 3MB, P12 - 3MB, P13 - 10MB. Show which gaps these processes will be placed into when using:

1) the First-fit technique

2) the Best-fit technique

3) the Worst-fit technique

Indicate when and how, if necessary, compaction would occur in order to make the placement possible.