C Programming.

,

c) Given the following sequence of numbers 14, 15, 4, 9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14,5. i. Construct the binary search tree according to the given sequence. (5 points) ii. Provide the in order, preorder and post order traversal of the binary search for the constructed tree in part A. (5 points) Write a search function that determines if a given value is in the tree or not. (15 points) 111