Given a stacks, 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 = 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: O a. false O b. error O c. true O d. infinite recursion