Question 4 0/1 pts If we maintain both a head pointer and a tail pointer for a linked list that contains n elements,what is the big oh runtime for inserting a new element the head of the list? at Oin 2) None of the abone Oin log n O3 Incorrect 0/1 pts If we maintain both a head pointer and a tail pointer for a linked list that contains n elements, what is the big-oh runtime for deleting the element at the head of the list? Ofn log n On a