c$.$ Based on what you have done for Question $1$b$,$ what is the big$-$O $($worst case$)$

complexity of the total time required to build a binary search tree $($BST$)$ consisting

of $n$ nodes? Explain your answer. Answer without explanation gains no mark. $($Hint$.$

A tricky question. The question asks for worst case complexity. Think properly.$)$

$(5\mathrm{.}0$ marks$)$