Suppose we define a binary tree node as follows: /struct for a single node in a binary tree. info contains the data stored in this node, left and right contain pointers to the left and right subtrees respectively, All of the data stored in the left subtree is smaller than into. All of the data stored in the right subtree is larger than info./struct node { int info: struct node *left: struct node *right: }: typedef struct node node: Write a recursive function maxExtract which finds and deletes the node with the largest info value. It should return the info value stored in that node. You can assume the tree is non-empty. Ensure that the tree is still connected after the deletion (use the in the double pointer to change what is stored in the current location in the tree). int maxExtract (node **tree) {