Using the provided picture:

Assume that the processes have the following page referencing trace

Pr$1$ has $($P$1,$ P$2,$ P$3)$ allocated to RAM $($Pg$1,$ Pg$2,$ P$3)$; and $($Pg$4,$ Pg$5$ on Disk$).$

Pr$1$ reference trace:: P$1,$ P$2,$ P$2,$ P$3,$ P$4,$ P$1,$ P$1,$ P$2$

Pr$2$: Has $($P$1-$P$5)$ allocated to memory pages $($Pg$4-$Pg$8)$ and $($Pages Pg$6,7$ and $8$ on Disk$)$

Pr$2$ page reference trace: p$1,$ p$2,$ p$3,$ p$4,$ p$4,$ p$5,$ p$6,$ p$1,$ p$7,$ p$8,$ p$8$

Pr$3$ has $($P$1)$ allocated to RAM $($Pg$9)$ and $($Pg$2$ on Disk$).$

Pr$3$ reference trace:: P$1,$ P$1,$ P$2,$ P$2,$ P$1$

Pr$4$: has P$1$ allocated to P$10.$

Assume that the time required to reference a page in RAM $=100$ millisecondsl

And the transfer time $($disk to memory$)=2000$ milliseconds.

When you need to replace a page for a particular process, always use the first page in memory which belongs to the same process; for example for Pr$1$ always replace pg$1$; for Pr$2,$ always replace pg $4$ and so on$.$

Question:

For each process find the total execution time;

Show the final memory allocation schema.