Consider a sorted circular doubly-linked list where the head element points to the smallest element in the list.

a. What is the complexity of determining whether a given element exists in the list?

b. What is the complexity of deleting a given element e in the list (not including the cost of finding it)?