Just answer far a,b,c

e to accomplish the given tasks: class Node int key Node 'left, right; public: Node (int key); int get key0; Node "get left0; Node "get right0: class BST Node" root void destroy_tree(Node* leaf): void insert(int key, Node leaf): Node" delete_node(Node" root, int key); public: BSTO: void insert(int key): int search (int key) void delete_node (int key); void in_order): void print tree0: void destroy_ tree0: the tree. Use recursion to write the function. The function is to be written outside of the class definition-not included in the class definition. ot): a. Write the function (or functions as needed) to find the maximum value in b. Add the function prototype(s) to the class definition. c. Label the two cases of the recursive function. 64H (411