Q3

Let $\textsf{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 $\textsf{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 $n$ denote the number of nodes in each of the linked lists. Which one of the following choices is $\text{TRUE}$ about the worst-case time complexity of $\textsf{SLLdel}$ and $\textsf{DLLdel}?$