solve it with C language

Exercise 1 - Numbers. operations with resursive functions.[3 marks) Exercise Objectives Identifying the base case(s) and recursive step used to understand/write a recursive function Implementing and calling recursive function Problem Description Open replit.com IDE, create a new repl (project) and name it "Lab106xr". Use this project to write and run a C program that performs the following Declare the following functions as prototype and implement them after the main function DigitsCount(), a recursive function that receives an integer number, and returns the number of its digits. (Hint: You can use a static variable to store count) ReverseNum), a recursive function that receives an integer number and returns its reverse value. (Hint: You can use a static variable to store the result of reversing powo), a recursive function that receives two integer numbers and m, and returns to the power m SeriesSum). this recursive function receives an integer numbers, and returns the summation of the first in terms of the following series (recursively 1 1 1 2 3 4 Hint within this function, use another statis variable to keep flip from negative (even terms) to positive fodd terms] In the main function declare two positive integers and y, and prompt the user to read both of them, then call the functions declared above as follows: Find the number of dipts for x Test if x b palindrome number or no by comparing with its reverse (you need to call ReverseNum) for Find the GCDIY). by calling the specified function Call SeriesSum) the for y terms Organize the output to appear as shown in the sample output below Download your project as zip file and keep it within your file system (Desktop for example) Upload the project to the elearning platform Sample Output Please enter the value for x 4224 Please enter the value for y 12 The number of digits for 4224 15 4 The reverse of 4224 is 4224 Page 2 of 5 4224 is a Palindrome number pow(S. 3) is 125 Summation of the first 12 terms of the series 0.65