The class List Queue , as given in Listing 14-1, maintains the queue's front at the end of a list of the queue's entries and has the back of the queue at the beginning of that list. Note that the list is an object of the class Linked List. What is the impact on the efficiency of the operations enqueue and dequeue if we were to maintain the queue's front at the beginning of the list and the queue's back at the list's end?