In a skip list with n nodes. Suppose that, for each node, the probability of gaining each extra level during insertion is k$1$ for some constant k $($instead of the original $12).$ Answer the following two questions:

$1.(6\%)$ Compute the expected total number of pointers in all n nodes $($using n and k as parameters, excluding the pointers in the header$).$ Explain your answer briefly.

$2.(9\%)$ If the height of the header is h$,$ formally prove a good upper bound on the expected time of search operations $($in big$-$O notation, using h and k as parameters$).$

please teach me the right thing...dont want answer from chatgpt thanks a lot!!!