$4.$ Memory Management $(6$ P$)$

a$)$ Management of free memory $(3$ P$)$

In a main memory, the processes P$1$ to P$6$ 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:

$\backslash [$

$\backslash$begin$\{$array$\}\{$l$\}$

$\backslash$text $\{$ P$7$: $\}10\backslash$mathrm$\{$MB$\}\backslash \backslash$

$\backslash$text $\{$ P$8$: $\}8\backslash$mathrm$\{$MB$\}\backslash \backslash$

$\backslash$text $\{$ P$9$: $\}6\backslash$mathrm$\{$MB$\}$

$\backslash$end$\{$array$\}$

$\backslash ]$

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

b$)$ Page placement algorithm $(3$ P$)$

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.

For the page replacement strategies listed below, specify the order in which the pages $0$ to $3$ are replaced in the case of page faults.