I need help answering these questions about, and be able to understand what is going on with abstract data types ADT

One fundamental choice in algorithm (or ADT) design i disadvant information. Both of these data types have advantages, and 17-18 programming: Bags, Stacks and Queues [8 pointto operatiousges, and choosing the appropriate of a singly linked list is given can make the different between constant and linear time Opeingly lin For reference, a standard implementation for the nodes is whether to use public class LinearNode public void setNext (Linear Node nod getNext ) f return next: node ; next public T public void setElement(Telem) { element= getElement ) return elementi elem ; 1. If you needed to store 25 names of students, and want lists be better? Explain. 12 points points) ets, and wanted to access them quickly, would arrays or lin 2. The following snippet of code defines the Recorder int crfe might The recorder ADT is used to keep of various objects- it is a method of tagging. For example, one messages (objects) have been displayed user. a Recorder, with the Recorder offering function (contained), or undo adding the last element (eg., window clos public inteface Recorder dditional functionality to check if a messages was displayed closed before read by user). to the user. This could be represented by adding items to void add (Item item); //add an item boolean contains (Item item) //is item n void undo (); //removes the last item added. Give an implementation of Recorder that allows the addition of elements in O(1), query of elements in O(n) time, and removing elements in O(1) time. [6 points