Just part c please. I'm having trouble visualizing this.

(a) In this question, consider a SkipList L created by inserting a set S of n keys into an (initially empty) SkipList. Assume that we re-create a SkipList by inserting the same keys, in the same order, but this time the probability p is 0.01. Will the expected time to perform find(x) operation increase or decrease, compared to the expected time for the same operation in the original SkipList? (b) Repeat the question, but now assume p = 0.9. (c) Let d be a fixed positive integer. Next consider a perfect SkipList constructed as follows: In order to create the ith level L_i of the SkipList, we scan the keys of level L_i - 1, and promote to L_i every d'th key. So for example, the perfect SkipList discussed in class uses the value d = 2. The case d = 3 implies that every third key is promoted, and so on. i. What exactly is the worst case running time of find(x), as a function of d and n? ii. Plot a graph that shows the search time as a function of d, and deduce what is the optimal value(s) of d