Given $n$ integers in an unsorted array $A$ :

$($a$)$ Describe an algorithm that uses an AVL tree to sort the $n$ integers. This sorting algorithm is called AVL sort. $($Hint: you will need to use one of the traversal algorithms$)$

$($b$)$ Given the running time for such this sorting algorithm.

$($c$)$ How does this compare to other sorting algorithms we studied in class? Is it optimal $($e$.$g$.$ the same as the best time for sorting via