a(i) Create a binary search tree by inserting the following elements in the given order: 45, 24,73, 36, 65, 87,94, 18, 88. After creation delete the elements in the following order: 18, 87,45. Support your answer with necessary diagrams. Create a min-heap by inserting the following elements in the given order: 45, 24, 73, 36, 65, 87, a(ii) 4 94, 18, 88. After creation, perform deletion for three times. Support your answer with necessary diagrams. 6