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 after all items are pushed, popping the items from the stack and inserting each item at the end of the list. Assume push and pop are O(1). What is the expected Big-O running time if: a. If an ArrayList is passed. Explain your answer. b. If a Linked List is passed. Explain your answer.

Allison and her group have completed the data entry for their spreadsheet project. they are in the process of formatting the data to make it easier to read and understand. the title is located in cell a5. the group has decided to merge cells a3: a7 to attempt to center the title over the data. after the merge, allison points out that it is not centered and looks bad. where would the title appear if allison unmerged the cells in an attempt to fix the title problem?