Q$\mathrm{.}3)$

A $2-$Mbyte block of memory is allocated using the buddy system.

a$)$ Show the results of the following sequence by dividing the memory into appropriate blocks.

A$-$Requests $140-KB$;

B$-$Requests $312-$KB;

C$-$Requests $456-$KB;

Release B;

D$-$Requests $356-$KB;

E$-$Requests $127-$KB;

F$-$Requests $68-KB$;

Release C;

Release F;

Release A;

Release D;

Release E$.$

b$)$ Show the binary tree representation following 'Release C$\text{'}.$