Example Code Ch 12-3

Example Code Ch 12-3
Given the two recursive methods shown below, foo and bar.
Assume int[] a = {6, 2, 4, 6, 2, 1, 6, 2, 5}
public int foo(int[] a, int b, int j)
{
if (j < a.length)
if (a[j] != b) return foo (a, b, j+1) ;
else return foo (a, b, j+1) + 1;
else return 0;
}
public int bar(int[] a, int j)
{
if (j < a.length)
return a[j] + bar(a, j+1) ;
else return 0;
}
-Refer to Example Code 12-3: What is the result of calling foo(a, 2, 9) ?

A) 0
B) 1
C) 2
D) 3
E) 4