Suppose you are given an array A having $8$ integers $(10,20,30,40,50,60,70,80).$ Draw a randomized binary search tree $($BST$)$ using the randomized Quicksort. Why ordinary quick sort is not good for drawing a randomized BST$.$ Justify your answer