CSC 143

Here are five problems for 2 points each. What is the final output? Add {1, 3. 5, 7} to a stack #1 Remove three items from stack, place in queue Remove two items from queue, place in stack #2 Remove one item from stack #2. Remove one item from stack #1. #2 A letter means push and an asterisk means pop in the following sequence. Give the sequence of values returned by the pop operations when this sequence of operations is performed on an initially empty LIFO stack. EAS*Y*QUE*** ST***IO*N*** A letter means add and an asterisk means remove in the following sequence. Give the sequence of values returned by the remove operation when this sequence of operations is performed on an initially empty FIFO queue. EAS*Y*QU Write a method mileage that accepts a stack of integers as a parameter and appends the stack's contents to itself in reverse order. When a stack, front-->[42. 33. -17][42, 33, -17, -17, 33, 42]