3) (50p) An available (empty) 128K memory is used with Buddy memory allocation technique. A following list of memory operations (S: request and D: release/return) are made in the given order: S20, S15, S10, S25, D20, D10, S8, S30, D15, S15 After each operation, clearly show the state of the memory (by following the given format): Balang 128K durumu S20 20*.32.64 S15 S10 S25 D20 D10 S8 S30 D15 S15 Assume that Buddy system is using tree representation to keep track of the memory. After all the operations given above are carried out: i. How many nodes does the tree contain (including root, and intermediate ones)? ii. How many leaves in the tree point an available (empty) memory block