Recall that the tree data structure has the following fields: value, left, right 2. (8 pts) Complete the function sum that calculates the total of all the values of the nodes in a binary search tree. Write this function recursively: If t is NULL, return 0 (no items in tree) Else, return the node's value sum of the left subtree sum of the right subtree int sum (TreeNode *t)