$($Compare performance$)$ Write a test program that randomly generates $500,000$

numbers and inserts them into a BST$,$ reshuffles the $500,000$ numbers and performs

a search, and reshuffles the numbers again before deleting them from

the tree. Write another test program that does the same thing for an AVLTree.

Compare the execution times of these two programs.

Due on Jun $24,202411$:$59$ PM