BinaryNode Copy with Threads One of the responsibilities of the binary node class is to make a copy of the tree rooted by the node. This is done recursively. The threads complicate matters. Consider the following binary tree with threads null In making a copy, a new node is created for copying the root, and then the left and right subtrees are copied Notice that the links cannot be a straight copy. If so, they would refer to nodes in the original. Assume that the recursive copy correctly threads all of the nodes within the subtree, with the exception of the last threaded node in the subtree. Here is a picture after the copies have been made. null null b' Question 1: On the picture, indicate the changes that need to be made to complete the copy Question 2: Give an algorithm for a method linksubtreeThreadout(Binarysode linkTo) that will link the thread coming out of the left subtree Question 3: Give an algorithm for a method getSubtreeleftmost(that returns the node in the right subtree that should be the target of the thread from the root. Use the previous two algorithms to show how the following tree is copied. BinaryNode Copy with Threads One of the responsibilities of the binary node class is to make a copy of the tree rooted by the node. This is done recursively. The threads complicate matters. Consider the following binary tree with threads null In making a copy, a new node is created for copying the root, and then the left and right subtrees are copied Notice that the links cannot be a straight copy. If so, they would refer to nodes in the original. Assume that the recursive copy correctly threads all of the nodes within the subtree, with the exception of the last threaded node in the subtree. Here is a picture after the copies have been made. null null b' Question 1: On the picture, indicate the changes that need to be made to complete the copy Question 2: Give an algorithm for a method linksubtreeThreadout(Binarysode linkTo) that will link the thread coming out of the left subtree Question 3: Give an algorithm for a method getSubtreeleftmost(that returns the node in the right subtree that should be the target of the thread from the root. Use the previous two algorithms to show how the following tree is copied