For the Questions Below, Assume That Int[ ] a =

Multiple Choice

For the questions below, assume that int[ ] a = {6, 2, 4, 6, 2, 1, 6, 2, 5} and consider the two recursive methods below foo and bar.
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[I] + bar(a, j+1) ;
else return 0;
}
-What is the result of calling foo(a, 2, 0) ;?

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