Exercise 1 Exercise Objectives Recursive Array Processing Problem Description Use this project to write and run a C program that performs the following: Creates 6-element 1-D integer array named Numbers. Fill the array with random values between (2 and 12), each run should give new random values and prints them in tabular format as in the sample output Pass the array to a function called find Highest that finds the maximum number in the array recursively and return it to the main. (don't use predefined functions to find the max) Pass the array to function called findlowest that finds the minimum number in the array recursively and return it to the main. (don't use predefined functions to find the min) Pass the max and min numbers to a recursive function called findGCD that finds the Greatest Common Divisor (GCD) and return it to the main Note: Greatest common Divisor (GCD) for two positive integers a and b is the largest number d such that a/d and b/d doesn't have any remainder, For example GCD(6.3) -- 3 and GCD(6,10) = 2. Pass the max and min numbers to a recursive function called intDivision, which finds and returns the result of dividing the max with the min. The main function Prints the values of the maximum, minimum the GCD and the division in tabular form as shown in the sample output Sample Output The array has been filled with 6 random numbers as following: Index 10 1 2 B 4 15 value 8 3 4 12 10 6 The Maximum number is: 12 The Minimum number is: 3 The GCD is: 3 The int divison is