1. Evaluate the four basic linked list operations for a sorted doubly linked list and indicate the worst case time-complexities of each.
2. Evaluate the worst case time-complexity for the search operation on a doubly linked list using a probe pointer.