Recall that a skip list is aprobabilistic data structure. Although the expected performance of a contains()call is O (logn), where n is the number of items in the list, the worst-case performance...

Recall that a skip list is aprobabilistic data structure. Although the expected performance of a contains()call is O (logn), where n is the number of items in the list, the worst-case performance could be O(n). Draw a picture of an eight-element skip list with worst-case performance, and explain how it got that way.