Here is how the SkipList is set up

(b) Assume that we re-create a SkipList by inserting n keys, in the same order, but this time we are using the randomized insertion algorithm shown on the slides. However a key that appears in level i is promoted to level i+ 1 with probability p = 0.1 (rather than p = 0.5 that was discussed on the slides) ill the expected time to perform find(x) operation increase or decrease, compared to the expected time for the same operation in the original SkipList created with p 0.5