Fill in the blanks of problem 10-1 on page 249 of the CLRS textbook and give your explanation for all cases. I've seen many different answers in the internet tutorial sites with different assumptions and conditions. If your reasoning is not correct, it will be considered a wrong answer. Please note the difference between (L, k) and (L, X), where k means a key and x means a pointer to an item x 10-1 Comparisons among lists 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? 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)