Given a stack s, and the following method, what is the output of test(Racecar); ?

public boolean test(String t)

{

Stack s = new Stack(); Stack u = new Stack();

for(int j = 0; j < t.length(); j++) s.push(t.charAt(j)+);

for(int k = t.length() - 1; k >= 0; k--) u.push(t.charAt(k)+);

while(!s.isEmpty() && !u.isEmpty()) {

String s1 = (String) s.pop();

String u1 = (String) u.pop();

if(!(s.pop().equalsIgnoreCase(u.pop()))

return false;

}

return true;

}

Select one:

a. true

b. infinite recursion

c. false

d. error