(Solved): A (correctly written) recursive Java method typically has: (a) at least one basis case o (b) at l ...

A (correctly written) recursive Java method typically has: (a) at least one basis case o (b) at least one recursive case O (c) at least one local variable (d) at least two parameters O (e) both (a) and (b) Consider the following two recursive methods: Version #1: public static void TwoNBlanklines(int n) { if (n > 0) { System.out.println(); TWONBlankLines (n-1); System.out.println(); } } Version #2: public static void TwoBlankLines(int n) { if (n > 0) { TWONBlankLines (n-1); System.out.println(); System.out.println(); } } 0 For a given value of n, Version #1 outputs more blank lines than Version #2 For a given value of n, Version #2 outputs more blank lines than Version #1 For a given value of n, both output the same number of blank lines Both are incorrect because neither has a basis case none of the above