how tracing of Gray code algorithm public class Beckett { public static void moves(int n, boolean forward) { if (n == 0) return; moves(n-1, true); if (forward) StdOut.println("enter " + n); else StdOut.println("exit " + n); moves(n-1, false); } public static void main(String[] args) { int n = Integer.parseInt(args[0]); moves(n, true); } } . I need a code for gray code algorithm, please. This is in java and I would like a code for a gray code algorithm, please. Thank you.