Suppose we have a sorted linked list that contains n integers, and we want to insert an element into that list in sorted order. How is that operation's runtime affected by whether or not we maintain a tail pointer (as opposed to only maintaining a head pointer)? Select all that apply. If we maintain a tail pointer, the best-case big-oh runtime for this sorted insertion becomes much better. If we maintain a tail pointer, the best-case big-oh runtime for this sorted insertion remains unaffected. If we maintain a tail pointer, the worst-case big-oh runtime for this sorted insertion becomes much worse. If we maintain a tail pointer, the worst-case big-oh runtime for this sorted insertion becomes much better. If we maintain a tail pointer, the best-case big-oh runtime for this sorted insertion becomes much worse.