Suppose a variable or dynamic partition is used with the same $5$ processes in

Question$1.$ The following events happened:

t$1$: process A and D left.

t$2$: process F $(50$K$)$ enters

t$3$: process B left.

t$4$: process G $(550$K$)$ enters.

Draw the memory stack at t$2,$ t$3$ and t$4$ and label the sizes clearly for all processes. Use

first$-$fit algorithm and relocatable dynamic partitions of merging adjacent holes to

place the process in the memory.