2) AVL Tree - Tracing The following code recurses over a AVL Tree and prints to standard output occasionally. Please trace through the code for the given AVL and write what would be printed out after the code terminates. Do not write the return value of the method. Just write each print statement's output on a new line Ensure that the print statements' outputs are correct and in the correct order. The method is run on the root of the AVL Tree public class Node { public T data; public Node left, right; public int height, bf; public void mysteryRec(Node current) { if (currentnull) { return; if (current.bf > 0) { mysteryRec(current.left); else { mysteryRec (current.right); if (current.data % 2--0) { System.out.println(current.data); Input BST: Output: 20 15 4 30 75 2 8 2) AVL Tree - Tracing The following code recurses over a AVL Tree and prints to standard output occasionally. Please trace through the code for the given AVL and write what would be printed out after the code terminates. Do not write the return value of the method. Just write each print statement's output on a new line Ensure that the print statements' outputs are correct and in the correct order. The method is run on the root of the AVL Tree public class Node { public T data; public Node left, right; public int height, bf; public void mysteryRec(Node current) { if (currentnull) { return; if (current.bf > 0) { mysteryRec(current.left); else { mysteryRec (current.right); if (current.data % 2--0) { System.out.println(current.data); Input BST: Output: 20 15 4 30 75 2 8