Let SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLLdel be another function that deletes a node in a doubly-linked list given a pointer to the node and a pointer to the head of the list.
Let denote the number of nodes in each of the linked lists. Which one of the following choices is TRUE about the worst-case time complexity of SLLdel and DLLdel?
- ASLLdel is and DLLdel is
- BBoth SLLdel and DLLdel are
- CBoth SLLdel and DLLdel are
- DSLLdel is and DLLdel is

