Create a queue application with 1. an empty queue of integers 2. add numbers to the queue, 3. calculate and print the difference between the first and the last element. Example: Input : 2, 3, 4, 5, 6, 7, 8, 9 Output :7 * Explanation: Last element is 9, first element is 2, the difference is 7

Data Structures/Algorithms in Java

def__init__(self): """ ------------------------------------------------------- Initializes an empty Queue. Data is stored in a Python list. Use: source = Queue() ------------------------------------------------------- Returns‌​‌​​​​‌​​‌‌​​​‌​​​​‌‌​‌​‌‌‌: a new Queue object (Queue) ------------------------------------------------------- """ self._values = []   defis_empty(self): """ ------------------------------------------------------- Determines if source is empty. Use: b = source.is_empty() ------------------------------------------------------- Returns‌​‌​​​​‌​​‌‌​​​‌​​​​‌‌​‌​‌‌‌: True if source is empty, False otherwise. ------------------------------------------------------- """ return len(self._values) == 0   def__len__(self): """ ------------------------------------------------------- Returns the length of source. Use: n = len(source) ------------------------------------------------------- Returns‌​‌​​​​‌​​‌‌​​​‌​​​​‌‌​‌​‌‌‌: the number of values in source (int >= 0)…

In Java please help with the following:   Sees whether this list is empty.@return True if the list is empty, or false if not. */ public boolean isEmpty(); } // end ListInterface Hint:Node class definition should look something like: public class Node<T> { T element; Node next; Node prev; public Node(T element, Node next, Node prev) { this.element = element;this.next = next;this.prev = prev; } }