This is for a C++ data structures class. Please write the code in C++ doing all steps.

Problem 1: Write the following 7 routines as member functions in a class using dynamic array ( pointer dynamic allocation) for data storage Also write inside the classes other appropriate functions like constructor/s, copy constructor, overloaded assignment operator, destructor, and other operator overloaded functions as needed. 1. To generate 100 random numbers between 1-100 in a randomData.txt file 2. To read the 100 random numbers from randomData.txt and store them in the dynamic array using input stream operator overloading. 3. Print the data using output stream operator overloading. 4. Find the smallest and the largest of the random numbers and position in the data structure. 5. Insert 1000 in the 57th element of the dynamic array and print the data. 6. Delete all the elements 50-70 (if any) in the data set using dynamic array only and print the data. 7. Sort the residual data set in an ascending order using recursive sorting and print in reverse order using recursion