5. Which of the following solution is best implemented using the Stack data structure? A. A program that receive and send print job to printer. B. A program that record the arrangement of cargo containers at the shipping port. C. A database program that allow user to access the records randomly. D. A data structure stores a collection of student records that require to add and remove the record from the front of the list. 6. What is the postfix notation of the following infix expression? 4 +8.3 A. +483 B. + * 483 C. 483 + D. 48 + 3 7. Given the following Java codes statements, what is the output of the program? Stack myQ = new Stack(); Object s; myo.push("X"); myq.push("Y"); myo.push("2"); s = myo.pop(); s = myo-peek (); s = myo.pop(); System.out.println( (string) s); A. X B. Y C. Z D. String 8. Each node in BST can have children. A. either zero B. either one C. either two D. All of the above 27 10 19 31 9. Refer to the figure above for Question 9 and 10 The types of tree for the figure above is A. a binary tree B. a strictly binary tree C. a complete binary tree D. an almost complete binary tree 10. are leaf nodes i. 27 ii. 14 and 35 iii. 10 and 19 iv. 31 and 42 A i B. i and ii C. ii and ill D. iii and iv