Q4) Assume a computer with a memory size of 256K, initially empty. Requests are received for blocks of memory of 17K, 6K, 63K and 9K. i) Show how the buddy system would deal with each request, showing the memory layout at each stage and the status of the lists at each stage. ii) The processes terminate in the following order: 6K, 9K, 17K and 63K. Discuss what happens as each process terminates