During this lab time, you need to sort a sequence of integers by an AVL tree: Write a function which creates n random integers that are then stored in a dynamic array. The function returns the pointer of the dynamic rrav Write a program which calls the above function for n 100 and then create an AVL tree to insert these integers. Use inorder traversal to print these integers. Don't forget to delete the AVL tree and the dynamic array before end of the program