Consider the following free$-$list structure:

$[100,150][210,300][540,800][300,380][950,1020][170,210].$

Assume:

On allocation, we just modify a node in the free$-$list and never move it$.$ If the entire node

is allocated, then the node obviously gets deleted.

On deallocation, the memory is returned to the end of the list.

Answer the following two questions:

Using a best$-$fit strategy, we allocate the following in the given order: $45$ bytes $($process A$),$

$30$ bytes $($process B$),150$ bytes $($process C$),80$ bytes $($process D$),90$ bytes $($process E$),$ and

$10$ bytes $($process $F).$

A$.$ State the memory start address for each process.

B$.$ What is the structure of the free list after the allocations are completed?

What will be the structure of the free$-$list if these processes are deallocated in the reverse

order of how they were allocated?