Provide a thorough Merge Sort implementation in Java utilising a generics approach.

Show the implementation representation (draw the linked list starting with topIndex) at each step of the following code sequence: Stack Interface s = new LinkedStack(); s.push("Elizabeth"); s.push("Anna Jane"); s.pop(); s.push("Joseph"); s.pop();

Describe the differences between the implementations of restricted and unbounded stacks.

During our conversation about Stacks, Queues, and Deques, we talked about the circular array implementation of a queue. 1. Why didn't we need a circular array implementation of a stack? What quality, specifically, does a queue have that led to a need for the circular array implementation? (You need to be specific here, but shouldn't require more than a sentence of two to answer this.) 2. You've seen that the dynamically-allocated array underlying a std::vector is resized periodically. Propose an algorithm for resizing the array used in the circular array implementation of a queue when it comes time to enqueue an element and the array is full. How much larger is your new array? How do the contents of your queue look different than before? 3. Assuming your algorithm was used to solve the problem of resizing the array when it's full, what is the amortized running time of the enqueue operation? (You may want to refer back to the Amortized Analysis lecture while you consider this.)