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 = 0; k--) u.push(t.charAt(k)+""); while(!s.isEmpty() && !u.isEmpty()) { String $1 = (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. infinite recursion O c. true O d. error