You are given a Tree implementation. This Tree implementation includes two member functions: insert and findTuple. The insert function inserts elements into the tree using BST (Binary Search Tree) logic. Your task is to complete the implementation for the function findTuple. The findTuple function takes three parameters: TreeNode*, diff, and vec. This function finds a tuple in the BST whose differences are given as the diff parameter to the function. The third parameter vec can be used to hold the node data when traversing the tree. For example, If the tree holds 14710111421 and the difference to be found is 4, you should print (10,14) as the tuple because these values satisfies the given difference. Use a recursive approach when writing the findTuple function