1 a) Build a binary search tree by inserting the followingelements (show all intermediate trees and then the final BST): 10,15, 5, 13, 30, 25, 20, 23, 65, 50, 40.
b) The following algorithm finds a certain value in a BST. Whatis the output if the following operation is done on the BST above?Explain the functionality of the following procedure.
c) Write a recursive procedure that performs the same operationas the FOO function above.
FOO(x) // x is the root of the tree
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured