USE PYTHON

Consider the following numbers: [21,9,15,17,25,4,30,35,23,11,27] a) Draw Binary Search Tree by inserting the above numbers as keys of the nodes from left to right. b) Write the pre-order traversal sequence of the tree and compute the depth of node 17. c) Identify whether the tree is full, complete, perfect and balanced. d) Perform the following operations step by step on the Binary Search Tree you created in part ' a '. i. Delete node with the key of value root with the help of its predecessor. ii. Delete node with the key of value new root with the help of its successor