3. For each of the four types of lists in the following table, what is the asymptotic worst-case running time for each dynamic-set operation listed? [28 points] Operation* unsorted, singly linked sorted, singly linked unsorted, doubly linked sorted, doubly linked SEARCH(L, k) INSERT(L, x) DELETE(L, x) SUCCESSOR L, x) PREDECESSOR(L, x) MINIMUM(L) MAXIMUM(L) * Note that L is a list of the specified type, k is a key, and x is a list cell