0/1pts If we maintain a head pointer for a linked list, but not a tail pointer, what is the big-oh runtime for deleting the element at the tail of the list, assuming the list contains n elements? (Assume we implement the operation as efficiently as possible with the given restrictions) None of the above 00(logn) Oin log n 0/1 pts Question 9 If we maintain a head pointer for a linked list, but not a tail pointer, what is the big-oh runtime for inserting an element at the tail of the list, assuming the list contains n elements? (Assume we implement the operation as efficiently as possible with the given restrictions) On) Oin log None of the above Oin! log n om