Assume that we have an efficient implementation of a queue based on a singly linked list (there are references to head and tail stored in the data fields in the class implementation). From which end should the dequeue method remove the value? either from the head or tail, it does not really matter from the tail (the last node) from the head (the first node) it needs to examine all elements in the list and find the largest one it needs to examine all elements in the list and find the smallest one