Please help me to do the lab hw, which is queue. Thank you so much!

First, here is queue file. import java.util.NoSuchElementException; public class Queue { private class Node { private T data; private Node next; public Node(T data) { this.data = data; this.next = null; } } private int length; private Node front; private Node end; /****CONSTRUCTORS****/ /** * Default constructor for the Queue class * @postcondition a new Queue object with all fields * assigned default values */ public Queue() {} /** * Copy constructor for the Queue class * @param original the Queue to copy * @postcondition a new Queue object which is * an identical, but distinct, copy of original */ public Queue(Queue original) {} /****ACCESSORS****/ /** * Returns the value stored at the front * of the Queue * @return the value at the front of the queue * @precondition !isEmpty() * @throws NoSuchElementException when the * precondition is violated */ public T getFront() throws NoSuchElementException { return null; } /** * Returns the length of the Queue * @return the length from 0 to n */ public int getLength() { return -1; } /** * Determines whether a Queue is empty * @return whether the Queue is emtpy */ public boolean isEmpty() { return false; } /** * Determines whether two Queues contain * the same values in the same order * @param o the Object to compare to this * @return whether o and this are equal */ @Override public boolean equals(Object o) {

return false;

} /****MUTATORS****/ /** * Inserts a new value at the end of * the Queue * @param data the new data to insert * @postcondition a new node at the end * of the Queue */ public void enqueue(T data) {} /** * Removes the front element in the Queue * @precondition !isEmpty() * @throws NoSuchElementException when * the precondition is violated * @postcondition the front element has * been removed */ public void dequeue() throws NoSuchElementException {} /****ADDITONAL OPERATIONS****/ /** * Returns the values stored in the Queue * as a String, separated by a blank space * with a new line character at the end * @return a String of Queue values */ @Override public String toString() { String result = ""; result += " "; return result; } }

Part 2: Adding Recursion to Your Queue and Stack

PrintReverse Methods:

• For *both* the Queue and Stack classes, write the below recursive methods to display the Queue and Stack in reverse.

/** * Prints in reverse order to the * console, followed by a new line * by calling the recursive helper * method printReverse */ public void printReverse() { return; } /** * Recursively prints to the console * the data in reverse order (no loops) * @param node the current node */

private void printReverse(Node node) { return; }

Sorted Order Methods (10 pts):

• For both the Queue and Stack classes, write a recursive method to determine whether or not a Queue or Stack is in sorted order (smallest value to largest value).
• First, update your class signature as follows to extend Comparable.

public class Queue> {}

public class Stack> { }

/** * Determines whether data is sorted * in ascending order by calling * its recursive helper method isSorted() * Note: when length == 0 * data is (trivially) sorted * @return whether the data is sorted */ public boolean isSorted() { return false; }

/** * Helper method to isSorted * Recursively determines whether data is sorted

* @param node the current node

* @return whether the data is sorted */ private boolean isSorted(Node node) { return false; }