1. Evaluate the worst case time-complexity of the Sparse Matrix ADT implemented in Programming Project 9.7.
2. Provide the code to implement the four basic operations - traversal, search, insertion, deletion - for an unsorted doubly linked list.
3. Provide the code to delete a node from a sorted doubly linked list.
4. Provide the code to delete a node from a sorted singly linked circular list.