Now we consider a deterministic version and suppose that we use

only two levels, i$.$e$.,$ two linked lists, for n elements. Each element is in linked list S$0$ and

some elements are also in the other linked list S$1.$ Please show that the search cost can

be minimized to O$($

n$).$