We define the notion of a "Balanced Binary Search Tree" $($BBST$)$ as a Binary Search Tree whose height is bounded by a log of the number of nodes. That is$,$ a BST with $\backslash ($ n $\backslash )$ nodes is considered a BBST if its height is $\backslash ($ O$(\backslash$log n$)\backslash ).$ Now, given a sorted array $\backslash ($ A $\backslash )$ with $\backslash ($ n $\backslash )$ elements, provide an algorithm that constructs a BBST with the elements of $\backslash ($ A $\backslash ).$ For full credit, the time complexity should be $\backslash ($ O$($n$)\backslash ).$