Page 7 Given below is a method for copying a binary search tree that traverses the original tree using an in-order traversal and inserting the keys into a new BST: Pseudo code: 1) Create an empty tree called COPY. 2) Process the original tree, one node at a time, beginning at the root 2b) Insert the key and value for the node into COPY. 2c) Process the node's left subtree, 2d) Process the node's right subtree, Java Code: public class MyBST { private Node root; private class Node { // root of BST private Key key; } private Value val; private Node left, right; // left and right subtrees public MyBST copy() { } MyBST copy = new MyBST (); copyHelper (root, copy); return copy; public void copyHelper (Node n, MyBST cp) { if (n == null) { } return; copyHelper(n.left, cp); cp.put(n.key, n.val); copyHelper(n.right, cp); } a) What will the new tree look like? Briefly explain your answer.