with explanation please

(20 points) This question pertains to skip lists. Let M be a random variable corresponding to the maximum level in a list of n elements. (This is exactly how we defined M in class. Note that M is not the same thing as the MaxLevel variable used in the skip list algorithm.) Give the tightest upper bound that you can find for E[M, the expected value of M, by simplifying the following summation: MaxLevel You can assume that axLevel Is ..large enough so that its value does not affect the analysis. (That is, replacing MaxLevel by oo would be an appropriate thing to do in the first step of your derivation.) You should formally prove your