Problem $2-5.(10$ points$)$ Suppose that the splits at every level of quicksort are in the porportion

$1-$ to $,$ where $0\frac{1}{2}$ is a constant. Show that the minimum depth of a leaf in the recursion

tree is approximately $-lg\frac{n}{l}g$ and the maximum depth is approximately $-lg\frac{n}{l}g(1-).$