please explain clearly with steps , what this code is doing? I am really confused. thanks.

PROBLEM 1: What will these methods do? Try tracing with linked list: "A" > "B" + "C" void methodl (Node> c) { if (c == null) return; System.out.println(c.data); methodl (c.next); } GIVEN: class Node { T data; Node next; } PROBLEM 2: void method2 (Node> c) { if (c == null) return; method2 (c.next); System.out.println(c.data); } class Stack { void push(T data) {...} T pop() {...} int size() {...} } PROBLEM 3: void method3 (Node> c) { Stack> Stack = new Stack>(); while (c != null) { stack.push(c); c = c.next; } while (stack.size() > 0) { System.out.println (stack.pop().data); } }