This problem has been solved!
see the answer
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 answer.