Java

a) Show the console output after the following code is executed. stack cstack = new Stack (); cstack.push('A'); cstack.push('B'); cstack.push('+'); system.out.print (cstack.peek); System.out.println (cstack.pop(); cstack.pop(); cstack.push('C'); cstack.push('A'); cstack.push('*'); while (!cstack.isempty()) System.out.print (cstack.pop()); b) Write Java code that displays all the objects in a stack in the order in which they were pushed onto it. After all the objects are displayed, the stack should have the same contents in the same order as when you started. Hint: use a temporary stack. c) (Extra points) Suppose you read a binary string-that is, a string of Os and 1s-one character at a time. Describe how you could use a stack but no arithmetic to see whether the number of Os is equal to the number of 1s. When these counts are different, state how you could tell which character occurs more frequently