Java thanks

Data Structures. Implement a stack with a queue 1. Goal: gain experience in stack and queue. 2. tasks: I. Write a stack interface which includes the following methods: a. isEmptyl) b. push(Object newtem c. pop); d. popAll); e. peek(); f. display(); II. Write a class named Astack to implement the above interface.* Hints: Utilizing the java.util Queue, which is a subtype of java.util Collection interface. It is an ordered list of objects with its use limited to inserting elements at the end of list and deleting elements from the start of list i.e. it follows FIFO principle. Since it is an interface, we need a concrete class during its declaration There are many ways to initialize a Queue object, most common being As a LinkedList Operations on Queue Add)-Adds an element at the tail of queue. More specifically, at the last of linkedlist if it is used. peek0-To view the head of queue without removing it. Returns null if queue is empty. element)-Similar to peek(). Throws NoSuchElementException if queue is empty remove()-Removes and returns the head of the queue. Throws