Implement a Stack class using a linked list. Write a tester class and name it Main. You are expected to structure the code as indicated in the UML class diagram:

Java

implement priority queue

PriorityQueue Main Node first -Node last +PriorityQueue() +boolean isEmpty +void add(int x) tint max() +void removeMax() +static void main(Stringargs) +Main Node -int info -Node next Node prev +Node() +void setinfo(int i) +void setNext(Node p) +setPrev(Node p) +int getlnfo) +Node getNext) +Node getPrev0 PriorityQueue Main Node first -Node last +PriorityQueue() +boolean isEmpty +void add(int x) tint max() +void removeMax() +static void main(Stringargs) +Main Node -int info -Node next Node prev +Node() +void setinfo(int i) +void setNext(Node p) +setPrev(Node p) +int getlnfo) +Node getNext) +Node getPrev0