Aurinn OP Ees wos Lab Stacks Queues and priority Occus (21 - Word Search Xoral Xdial Xdal Fle Home Insert Design Layout References Malings Fevic View Share Comments OD Help Table Design Layou: Gut Add-im W Cnline My Add-, Wipedia Vid Add Tohle Pictures Shapes cons ja JD Smart Chart Screenshot Mudeb- Cover Blank Page Page Page Back Pages Line Bookmark Cross re quabon Symbol Number Fils- Car Turin A A A Signature line Comment Uste & lime Ilender Footer Page Ispanese Test Quick Wort Drop Number Grocling - Bos - Porte- - Cobject Header anter Teat +1.7. Please complete the following table. Cperation Stack Output push("Mandarin) Shak CS 143 Lab 5: Stacks, Queues, and Priority Queues Winter 2021 Objective: in this lab you will practice the following skills: Use Java's Stack class to represent and process data Lise lava's Priority class to represent and process data pop() push("Mavel") push("Clorentine) hor push("Tangelo) push("Valencia") Task 1. Questions. (5 points) 1.1 What dices LIFO stand for? A Last Last Uut Last in First Out Answers First Last Out D. First la First Out 1.2. How many items can you put on a stack? As you locale when you create the stack Am A B. As many as will fit in the computer's memory As many as will fit in a single string D. Ten 1.3. Which operations does a stark support? Choose twal Delete Push Append Sort Pop 14. Which kind of structure is a stack? FIFO LIFO FILO LILO 1.5. Suppose variable LIFO is defined as a stark. How do you check to see if the stack kemerty? Choose two it (LFD) if (LTFO.size() > 0) 16. What happens if you call peek () on an empty stack? Hint: http://docs.oracle.com/asp/7/docs/api/java/util/stack.html] relurns cero B. peekt returns NULL reakthrows an exception D. You can't call pokl) on an empty crack b) 1.8. Please complete the following table. Operation Slack 15 Output 25 15 18 25 15 Rubric: . 11-16 1.7, 1.01 0.5 poi per question 1 point per tahle Type here to search o 4. ENG 0:54 PM 2/9/2001