This document outlines the implementation of a queue abstract data type in Java using a singly-linked list with a single access pointer. It specifies that enqueue and dequeue operations should be optimized for constant time performance and focuses on integer elements. A step-by-step description of the implementation process is requested to clarify the solution.

1. Implement in Java the Queue abstract data type using a singly-linked list with only one access
pointer (instead of two: Q.head and Q.tail). ENQUEUE and DEQUEUE operations should take
constant time. Assume elements are integers. Briefly describe your implementation in the report.
Clear solution with step by step and explaining it please.