Write the code in Java or C and provide time complexity analysis to show what time complexity it is in big O form (e.g. O(log n)).

3. Implement a Queue by linked list. 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: private AnyType data; enqueue(1) private Node next; enqueue(2) enqueue(3) public Node (AnyType data, Node next) dequeue() // return 1 this.data = data; enqueue(4) this.next = next; dequeue() // return 2