Question $2$: Write a program in a language of your choice to implement the insert operation in

an AVL tree, where each node in the tree contains a dictionary word. Suppose n is the number

of words in the tree at any time. Draw the $$Input vs$.$ Time$$ graph for different values of n$.$

$($That is$,$ for each value of n$,$ start from an empty tree and record the time taken for inserting n

nodes.$)(40$ points$)$