1. Let A be an array consisting of elements in the following order 11,40, 20, 13, 21,50, 60, 9, 2,10 (75 Points) (a) Draw the binary search tree that is obtained by adding/inserting the elements (without (b) If the resulting tree is not balanced, perform balancing as per AVL tree discussed in balancing) in the order they appear in the array. lectures. Specify the steps needed to balance (left rotation/right rotation etc) and draw the resulting balanced tree (c) Draw the hash table (using chain hashing) obtained by by adding the above elements using the hash function (2x+ 3)%5