Please complete ALL parts using C programming language:

g. Write the code to construct the binary search tree in the figure below: 7 5 14 6 10 16 15 h. Implement the search algorithm for a particular value in the tree. Search for the values 5, 7, 16, and 15. i. Visit the different binary search tree nodes using inorder traversal. j. Write the code to insert a new node into the binary search tree. Insert a couple of new nodes with values you select