This question pertains to skip lists. Let M be a random variable corresponding to the

maximum level in a list of n elements. Give the tightest upper bound that you can find

for E$[$M$],$ the expected value of M$.$ You may assume that MaxLevel is $$large enough$$ so

that its value does not affect the analysis.