Write a function that gets a 2-d array of ints arr[height][width], and returns an array SUM of length height such that SUM[i] contains the sum of all values in the i’th row of the array. For example - On input {{ 1, 2, 3}, {4, 7, -2}, {9, 10, 11}, {1, 5, 4}}; the function returns { 6, 9, 30, 10} // returns array SUM with SUM[i] = sum in the i’th row int* sum_row(int height, int width, const int ar[height][width]);   Test for the function: void test_q2() { intar[4][3] = {{1, 2, 3}, {4, 7,-2}, {9,10,12}, {1, 5, 4}}; int* m = sum_row(4,3, ar); intm0 = m[0]; intm1 = m[1]; intm2 = m[2]; intm3 = m[3]; free(m); // checking dynamic memory allocation if (m0==6 && m1==9 && m2==31 && m3==10) printf("Q2 ok\n"); else printf("Q2 ERROR\n"); }

Write a function that verifies if a given number exists in an array of floats. The function is supposed to return the first position in where the number is encountered. If the given number does not exist, the function returns –1. Then write a complete program that asks the user to enter an array of 8 floats and calls the function. The prototype of the function should be like:   int Search (floats a[ ], int n, float number);   Example: Consider the following array of floats int x[8]={2.1, 5.0, 9.8, 4.4, 6.8, 12.88, 9.87, 4.56}; If the number to be searched is 5.4, the function returns  –1 If the number to be searched is 9.8,the function returns  2   C++ language only.