Problem 4. Consider a Skip List with n nodes. Each node k has a random "height" hk, which is the number of linked lists that includes node k. The heights nodes are statistically independent, where P[hk=m]=2m, for m1 and P[hk=m]=0, for mm]n2m (b) [3 pts] Choose a value of c>0 such that P[H>m]n1 for m=clog2n (c) [5 pts] Show that E[H] is O(logn)