Extra Credit $(10$ Points$)$: 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. Do the same thing using an AVL tree. Make sure to have the program compare the running times for completing all of these tasks for these two different trees.