When choosing an algorithm and data structure to represent and process data, performance is always a concern. We can classify performance using BigO notation and designate the order of efficiency for a particular approach. Consider a linked list implementation that keeps track of both the list's head and tail nodes. If we use the tail pointer to add a node to the list, we can characterize the order of performance in which of the following ways?