Create a collection. Along with GETMAX, MAXSTACK supports the ADT procedures of PUSH, POP, and EMPTYSTACK and behaves like a standard linked stack. The GETMAX function logs the largest element in the stack. Can you construct the array so that GETMAX only requires O(1) time complexity?

JAVA please Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Code provided in the assignment ItemNode.java:

Code in Python:

Objectives: The code for the different stack and queue operations in both implementations (array and linked list) are discussed in the lectures: and are written in the lectures power point. So the main object of this assignment is to give the student more practice to increase their understanding of the different implementation of these operations. - The students also are asked to write by themselves the main methods in the different exercises below; The Lab procedures: The following files must be distributed to the students in the Lab - arrayImpOfStack.java // it represents an array implementation of the stack. - pointerImOfStack.java // it represents a Linked List implementation of the stack. - pointerImOfQueue.java // it represents a pointer implementation of the queue. Then the students by themselves are required to write the code for the following questions Ex1) Given the file arrayImpOfStack.java then write a main method to read a sequence of numbers           and using the stack…

True or false: a) We can use memory maps with LinkedLists. b) If all of the JUnit tests pass, the program is guaranteed to always work.

Write a function, to be included in an unsorted linked list class, called getLargest, that will return the largest item in the list.

Write a push method for a stack implemented as a linked structure. You may assume that the implementation has the top element of the stack referenced by a LinearNode reference top and that an integer variable count keeps track of the number of elements in the stack. Hint: LinearNode class has a method called setNext which allows to reference a LinearNode object.