a$)$ Management of free memory

In a main memory, the processes $P1$ to $P6$ are located. The gap between the processes is shown in Table $1.$ The following processes should be stored in the main memory in the given ordering:

$P7$: $10MB$

$P8$: $8MB$

$P9$: $6MB$

Apply the strategies Best Fit, Worst Fit, and Next Fit!

In Table $1,$ specify where the process is stored and how big the new gap is$.$

Newly created gaps are not taken into account by the memory management.

Table $1$ Overview Memory

$\backslash$table$[[,$Gap,$\backslash$table$[[$Pro$-],[$cess$]],$Gap,$\backslash$table$[[$Pro$-],[$cess$]],$Gap,$\backslash$table$[[$Pro$-],[$cess$]],$Gap,$\backslash$table$[[$Pro$-],[$cess$]],$Gap,$\backslash$table$[[$Pro$-],[$cess$]],$Gap,$\backslash$table$[[$Pro$-],[$cess$]],$Gap$],[$Memory$,12,$Pl$,6,$P$2,4,$P$3,25,$P$4,15,$P$5,9,$P$6,12],[$Best Fit,,$\frac{?}{PI},,$P$2,,$P$3,,$P$4,,$P$5,,$P$6,],[$Worst Fit,,Pl$,,$P$2,,$P$3,,$P$4,,$P$5,,$P$6,],[$Next Fit,,$Pl,,$P$2,,$P$3,,$P$4,,$P$5,,$P$6,]]$

b$)$ Page placement algorithm

A memory management unit works with four page frames. The table shows the load time, last access time, $R,$ and $M$ bits for each page. For the specified points in time: the larger the value, the newer the event.

$\backslash$table$[[$page$,$loaded,Last access,$R,M$