Recall the skip list data structures we introduced in class where concept of randomization is introduced.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 S0 and some elements are also in the other linked list S1. Please show that the search cost can be minimized to O(sqrt(n))