For an unsorted doubly-linked list, what is the asymptotic worst-case running time for the dynamic-set operations of SEARCH(L,K) and DELETE(L,x)? (Where x is an element of the list and k is the key of an element) O SEARCH(L,k): O(n) and DELETE(L,x): O(n). O SEARCH(L,k): O(n) and DELETE(L,x): 0(1). O SEARCH(L,k): 0(1) and DELETE(L,x): 0(1). O SEARCH(L,k): O(n^2) and DELETE(L,x): 0(1)