Enqueue at the Tail of a Linked Queue

LinkedQueue adds at the tail and removes at the head, so it tracks both ends. Every method except enqueue is already written.

Requirements:
1. Complete enqueue(int value) so it wraps the value in a new Node and links it on after the current tail.
2. When the queue is empty, head and tail must both end up pointing at the new node.
3. Increase size either way.

The Node class is provided - do not rename it and do not add public to it, because a Java source file may contain only one public class.

Do NOT write a main method.