1. (2) When using a singly linked list to implement a queue, the should be the front of the queue a. b. c. d. head node tail node neither the head node nor the tail node either head node or tail node as both implementations have the same efficiencv 2. (2) When using a singly linked list to implement a queue, the should be the rear of the queue a. b. c. d. head node tail node neither the head node nor the tail node either head node or tail node as both implementations have the same efficiencv 3. (2) The LinkedQueue class throws the EmptyCollectionException exception during operation(s) a. enqueue c. getFront e. dequeue and getFront b. dequeue d. enqueue and getFront 4. (2) Any application that could be solved using the handwritten ArrayQueue class could also be solved using the handwritten LinkedQueue class a. True b. False to insert an element to the rear of 5. (2) The Java Queue interface offers a method named the queue a. add enqueue c. nsert d. poll