Building and using a skip list in C:

a. Using the table format below, draw the skip list after inserting keys (coin tosses): 2 (H, T), 10 (T), 7 (T), 8 (H,T), 1(T), 6(H,H,T), 9(T)

S3	-
S2	-
S1	-
S0	-

b. Show the path for finding:

i. 10

ii. 4

Your answer has a list of nodes (key, level). For example: ... -> (2, S0) -> (4, S0) -> ...

c. In terms of coin tosses and the structure of the skip list, explain a scenario that is most undesirable.

OX OX OX OX OX OX OX OX OX OX OX OX OX OX OX OX