5. Suppose a Java method receives a List and reverses the order of the items it contains by removing each item from the front of the list, pushing each item onto a Stack, and then popping the items from the stack and inserting Us What is the expected Big-o running time if: a. If an ArrayList is passed. Explain your answer. b. If a LinkedList is passed Explain your answer. 20 points 6. Show each step of converting atb*c+(d-e) from infix to postfix notation, using the algorithm described in the textbook that uses a stack