The lastNode was useful for the insertAtBack and removeFrom- Back methods of the List class. The insertAtBack method corresponds to the enqueue method of the Queue class. Rewrite the List class so that it does not use a lastNode. Thus, any operations on the tail of a list must begin searching the list from the front. Does this affect our implementation of the Queue class?

What will be an ideal response?

The interface of the List class was not changed—just its implementation. Therefore, the Queue class does not need to be changed other than changing the import state- ments to point to the different List class. The performance of the Queue will be ad- versely affected because adding to the end of the List is now linear in the number of elements instead of constant time.