Part c. [3 points] In an AVL Tree, if a node to-be-deleted has two children, a candidate node needs to be found in the sub-tree. Assume an AVL Tree T that stores integers as keys, is given. Write a method that returns the candidate node in the sub-tree T. publio Node returnCandidate (AVL T) \{