Operating systems

3. Demonstrate your knowlege of the binary buddy system for memory management Consider 64KB of memory starting at address 0. In your demonstration, you will show the configuration of memory at each step including the starting address of each block, the size of each block, and whether the block is allocated or free Allocation will be from the smallest possible block. If there is a choice (because there are two or more such smallest possible blocks), allocation will occur from the block with the smallest starting address. The memory requests are, in order (a) allocate 13 as B1 (b) allocate 3 as B2 (e) allocate 15 as B3 (d) free B1 (e) allocate 5 as B4 (f) allocate 7 as B5 (g) free B2 The allocation operation is read as: allocate n as blockNumber The value n is the number of KBs to allocate, the blockNumber is needed later for the free operation