2. (5 pts): Answer the following questions. The input size variable in these questions is exclusively n Complexity Operation Searching for the lowest priced vest in a collection of n vests. Finding the highest priced tie in a list n of ties sorted by price. Remove a single element from the rear of a singly linked list of n items. The linked list uses a head and tail pointer Add a single element to the front of a singly linked list of n items. The linked list uses a head and tail pointer. Push two items onto a stack of n items