Problem 1. Write the following nested function calls int Func( int a, int b, int c, int d) return Max(atb, c-d); int Max( int m, int n if (m n) return m: else return n: Also, write a main program that calls the Fune function on the following data and prints out the result. =0,b= 2, c= 8, and d=31 Problem 2. Write a recursive function that computes the smallest integer in a given array of integers. Use the following algorithm: int Min( int JA, int low, int high) if (low high) return A[low]; nt mid-(low+high) Iint min1-Min(A, low, mid); int min2-Min(A, mid +1, high); if (minl>min2) return min2: else return min1: Also, write a main program that calls the Min function on the following data and prints out the result. A-{5, 2,-9, 10,-23, 43, 2, 1, 3, 5, 10), low = 0, and high = 10