QUESTION 17 Evaluate the following postfix expression: 24 +51 +38-127 45 QUESTION 18 O(n) is called time. QUESTION 19 Stacks are useful in situations where elements must be processed immediately we must deal with postponed obligations items are processed in the order they are encountered sorting is required QUESTION 20 Evaluate the following postfix expression: 6 4 3 10.22 2... What is the highest number of elements on our stack at any one time? QUESTION 21 A data type whose properties (domain and operations) are specified independently of any particular implementation is an) QUESTION 22 The Unified Method was the brainchild of a single software engineer, Grady Booch. True False QUESTION 23 The order of growth for the depth of recursion associated with the text's recursive factorial (returns N!) method is 011) Ollogg) OIN). Ova QUESTION 24 This Java statement is used to announce that an exception has occurred. Throw Raise Catch o Try