During this lab time, you need to do the following: Write a function which creates n random integers that are then stored in an array. The function returns the pointer of the dynamic array. 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 before end of the program. You can use the C codes of AVL provided by the textbook