C++ Write a recursive function that receives an integer array along with its length (the number of elements in the array) and then returns minimum of the numbers in the array. Using following function header: int min(int a[], int length); Solution Code: #include <iostream> using std::cout; using std::endl; #include <iomanip> using std::setw; int main () { void recursiveMinimum (int); const int arraySize = 13; int a[ arraySize ] = { 10, 55, 77, 3, 8, 54, 22, 11, 16, 18, 100, 25, 29 }; int hold; int e; cout << \"Data items in Unsort order:\ \"; for ( int i=0; i < arraySize; i++ ) cout << setw(4) << a[i]; for ( int pass = 0; pass < arraySize - 1; pass++ ) for ( int j = 0; j < arraySize - 1; j++ ) if ( a[j] > a[j + 1] ) { hold = a [j]; a [j] = a [j + 1]; a [j +1] = hold; } cout << endl << \"The data items in sorted order is: \ \"; for (int k=0; k < arraySize; k++ ) cout << setw(4) << a[k]; recursiveMinimum ( a[0]); cout << endl << endl << \"The smallest element of the array is: \"; cout << a[0] << endl << endl; return 0; } void recursiveMinimum (int e) { e *= 1; } .