Consider below Binary Seach Tree $($BST$)$ in Figure $5.$ Below Binary Search Tree is unbalanced. Convert it into balanced BST$.$ Demonstrate step by step process using the diagrams:

$(15$ Marks$)$

Sort $($in ascending order$)$ the array $=[56,40,30,78,23,7,9,11,12,5]$ using Quick sort. Demonstrate your answer step$-$by$-$step.

$(15$ Marks$)$