C++

PROGRAMMING PROBLEM 1 (a) Modify the int findMax (int[]) function in Program 7.6 of Bronson text to additionally find the minimum. As such develop the function with the prototype void findMaxMin (int[],int&, int&) [10 points] (b) Include the function developed in part (a) above in a complete program and run the program. Use at least two sets of data to verify the function. I5+5+5+5 points] (c) Rewrite the function developed in part () above using vector class and functions specified in Table 7.2 of Bronson text. Your new function prototype will be as follows: void findMaxMin (vector &, int&, int&). Test it as in part (b) [10+5 points] PROGRAMMING PROBLEM 2 Define an array, int nums[, with a maximum of 20 integer values, and fill the array with numbers input from the keyboard or assigned by the program, Then write a function named int split (int [], int [, int [, int , int&) that reads the array and places all zeros or positive numbers in an array named positive, al negative numbers in an array named negative and returns the counts of positive integers (by value) and negative integers (by reference). Finally, have your program call a function void display(int [, int [], int, int) that displays the values in both the positive and negative arrays[S+5+5 (main)+5 (split)+ 5 (display)+5 points]