In a Buddy memory allocation system, a process is allocated an amount of memory whose size is the smallest power of $2$ that is greater than or equal to the amount requested by the process.
A system using buddy memory allocation has $1MB$ memory. For a given sequence of nine processes, their respective memory requirements in $KB$ are$:50, 150, 90, 130, 70, 80, 120, 180, 68.$
- Illustrate with an allocation diagram to justify whether all the requests, in the given order, can be complied with. Assume that memory once allocated to a process is no longer available during the entire span of the above sequence.
- Calculate the total memory wasted due to fragmentation in your memory allocation by the above scheme.
