Show tracing of Towers of Hanoi algorithm public class TowersOfHanoi { // print out instructions for moving n discs to // the left (if left is true) or right (if left is false) public static void moves(int n, boolean left) { if (n == 0) return; moves(n-1, !left); if (left) StdOut.println(n + " left"); else StdOut.println(n + " right"); moves(n-1, !left); } public static void main(String[] args) { int n = Integer.parseInt(args[0]); moves(n, true); } } Towers of Hanoi algorithm to show the function call trace. You must show both the call (i.e. moves(2, true) and correctly indent the function and result.