a$.$ Binary search tree provides a best case time complexity of O$($log n$).$

Explain a situation where it may increase this complexity to O$($n$).$

b$.$ Assume you have a sorted list of elements. Explain how to arrange this

set of numbers so that you get a balances binary search tree after

inserting these numbers.

c$.$ Insert the following numbers into an AVL tree.

$10,30,24,45,56,12,4$

d$.$ What is the worst$-$case time complexity of an AVT tree for delete

operation?

e$.$ Delete the element $12$ from the above AVL tree. Show each step