#5. Skip Lists (7 points) Here is a skip list, including instance variables s (the starting position), h (the height: we assume that h starts counting from 0), and n (the number of keys currently stored in the skip list). For simplicity, the graphic shows only horizontal lines, but keep in mind that these are doubly linked lists in both the horizontal and vertical directions. You may also use this simplified drawing in your responses. s h-3, n-4 S3 -inf +inf S2 -inf 15 +inf S1 -inf15 23+n So -inf H10 15 23 36+inf (a) (1 pt) Trace the path that SkipSearch(23) takes, by circling every node that p is assigned to as the SkipSearch algorithm executes, starting with s. (You may want to print out the diagram, trace it with a dark pen, and scan or photograph it to include in your document.) #5. Skip Lists (7 points) Here is a skip list, including instance variables s (the starting position), h (the height: we assume that h starts counting from 0), and n (the number of keys currently stored in the skip list). For simplicity, the graphic shows only horizontal lines, but keep in mind that these are doubly linked lists in both the horizontal and vertical directions. You may also use this simplified drawing in your responses. s h-3, n-4 S3 -inf +inf S2 -inf 15 +inf S1 -inf15 23+n So -inf H10 15 23 36+inf (a) (1 pt) Trace the path that SkipSearch(23) takes, by circling every node that p is assigned to as the SkipSearch algorithm executes, starting with s. (You may want to print out the diagram, trace it with a dark pen, and scan or photograph it to include in your document.)