Problem R$-3\mathrm{.}10$ of the GT book: Suppose that a binary search tree, T$,$ is constructed

by inserting the integers from $1$ to n in this order. Give a big$-$Oh characterization of

the number of comparisons that were done to construct T$.$