This problem involves describing how memory requests are allocated within a $1024K$ block of memory using the Buddy System. Answers have to be

provided in a very specific format. The block starts off empty, which would be described with:

$1024$

An empty partition is described by simply providing a number. If Process A makes a request for $70$K$,$ then the Buddy System splits memory to create a $128K$

partition to store A$,$ but also creates additional partitions in memory. The resulting configuration would be described like this:

$A128,128,256,512$

Note that there are no spaces in this answer. An occupied partition is designated by the letter for the process followed by the number of allocated KB$.$

Empty partitions are simply specified by a number. Each partition is separated by a comma.

Carrying on after the allocation of A specified above, indicate how memory looks after each of the following allocation and deallocation requests.

Process $B$ requests $35K$ :

Process $C$ requests $80K$ :

Release A:

Process $D$ requests $60K$ :

Release B:

Release D:

Release C: