15 points 6. 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, adding each item to a Stack, and then removing the items from the stack and inserting each item to the end of the list. 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