can I get help with question d and it relates to b

Figure 1: An empty BST for questions 2(b), 2(c), and 2(d) on left and the BST lor question 2(c) on right. 2: Binary Search Trees (BSTs) (a) Insert the following items into a BST, in the following order: [11,5 : 10, 21,49,35,8,46]. Show the resulting tree. [6 marks. (b) Put the lollowing items into the BST in Figure 1a [28,37,13,48,56, 9,50,62. Io this always unique for a fixted array and a fixed BST? Jnst ify your answer. [6 marks] (c) Mark all nou-balanced nodes in the BST in Figure la. Justify your answer. [6 marks] (d) In the BST you got in the part (b) delete the following items, in the following order: [9,50,28. (So when deleting 50,9 is not in the tree any-more ...). Show how the BST changes in each deletion. 6 marks] (e) Consider the AVL 'lree in Figure 1b. Delete the number 11 to the tree. Note that you might need to do some rotations to preserve the AVL property. [6 marks]