Question 1 (35 points) a) What are the differences between the stack and the queue? (5 points) b) Fill in the blanks in each of the following: (5 points) i. Function ....... . is used to reclaim dynamically allocated memory. ii. The nodes of a(n)....... tree contain two link members. iii. A queue is referred to as a(n).. .... data structure. iv. The first node of a tree is the .....node. V. A(n).......... ...is a specialized version of a linked list in which nodes can be inserted only at the start of the list and deleted only from the end of the list. 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)