3. Implement a Queue by linked list with only the given node (no other usable built-in data structures). Support the following basic methods: 1. enqueue(item). Put a new item in the queue. 2. dequeue(). Move the first item out of the queue, return it. Example: private static class Node Input: enqueue(1) private Arlytype data private Node AnyType> next; enqueue(2) enqueue(3) public Node (AnyType data, Noda next) dequeue() // return 1 this.data - data: enqueue(4) this.next - next; dequeue() // return 2 3. Implement a Queue by linked list with only the given node (no other usable built-in data structures). Support the following basic methods: 1. enqueue(item). Put a new item in the queue. 2. dequeue(). Move the first item out of the queue, return it. Example: private static class Node Input: enqueue(1) private Arlytype data private Node AnyType> next; enqueue(2) enqueue(3) public Node (AnyType data, Noda next) dequeue() // return 1 this.data - data: enqueue(4) this.next - next; dequeue() // return 2