(a) Write a C++ program that takes n number of elements as input and save them in binary search tree. After that find out the total number of nodes that are: Leave nodes Nodes with only child Nodes with both left and right child (b) Modify the above code so it will be able to save the balance & height of each node.