The language Java. Thanks in advance.

12. If a stack is used by an algorithm to check for balanced braces (as discussed in lectures), which of the following is true once the end of the string is reached? a) the stack is empty b) the stack has one "" c) the stack has one d) the stack has one "(" and one " e) None of the above as they are all false. 13, Which of the following is the postfix form of "(a + b)c/d"? b) ab c/d+ d) ab cld -d a b+cd* / C+ Ct lo e None of the above. 14. The node that is directly above node n in a tree is called the node of n. a) root b) leaf c) parent d) child e) None of the above. 15. A descendant of node n is a node on a path from node n to_ a) b) c) d) e) the root a sibling node of n a parent node of n the item field of n None of the above. 16. The- of a tree is the number of nodes on the longest path from the root to a leaf. a) height b) length c) width d) age e) None of the above. Page 6 of 1s