Trace the execution of the following call for the mystery recursive method by drawing method calls and return values diagram. What is the output of following method call? public static void main(String[] args) { System.out.println(mystery(5, 3)); } public static int mystery(int n, int k) { if (k -- 0 11 k-n) { return 1; } else if ( kn) { return 0; } else { return mystery(n - 1, k-1) + mysteryn - 2. k); } } EXAMPLE public static int factorial (int n) if (n