write a c++ program plese

7. Assume the array of size n filled with random integers, write a function that calculates the max number of increasing items in the subset of the array and print where the subset is start. For example if the array has the items A: 13 7 8) {2 5 11 13 14) (1020) {8} Note that the first subset of the array has 3 increasing items and the second has 5 increasing items and the third has 2 and the last subset has 1 increasing items. So your function should returns the largest one which is 5. (2 Pts)