$(2)$ Consider the skip list data structure. Suppose that we use only two levels, i$.$e$.,$ two

$($sorted$)$ 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 draw the skip list structure where

the minimized search cost is $O(\sqrt[\phantom{2}]{n})$