4. Assume that we have an array of numbers given below: 9,5,12,4,8,3,1,7,2,6,15,22,32,12,23,19 (a) (\%10 Write a function, CreateJree, which creates a Binary Search Tree. Note that the function receives the array as an input argument, constructs the tree and finally roturns a pointer to the root of the tree. (b) (%10) Write another function, Leafcount which counts the number of leat nodes in the Binary Search Tree. (c) (\%5) Assume that you want to perform a search operation in any Binary Search Tree. What is the computational complexity of such a search operation? Use Big-O notation to give the best and worst cases