Any skip list L can be transformed into a binary search tree T(L)as follows: The root of T(L) is the leftmost node on the highest non-empty level of L the left and right sub-trees are constructed recursively from the nodes to the left and to the right of the root. Let's call the resulting tree T(L) a skip list tree. Show that any search in T(L) is no more expensive than the corresponding search in L. (Searching in T(L) could be considerably cheaper-why?)