Answer Happy

hat is the output of the following program public class Fina 101 public stati int recurs vecint) return i return recurs AS- 11) public static int recursive(int n) if (n = 1) return 1; else return recurs en 1) - 1; public static int recursive int n, int n) if ( 10) return else return recurs tven) + 1 public static void method (int n) throws Exception try I 1 (n<0) throw now exception(); System.out.println(""); ) finally System.out.println(""); 2 System.out.println(""); Outpu public static void main(String[] args) { System.out.println(recursiveA(4,7)): System.out.println(recursiveB(A)); System.out.println(recursive (81, 3)); try { method(-1); } catch (Exception e) { System.out.println("A"); try { method(2); } catch (Exception e) { System.out.println("A");