No helper functions or Auxiliary functions. You must use recursion. Use magic functions. Your code must be such that if we insert it into a suitable test framework with a main routine and appropriate #include directives, it compiles. Please show the base case and the recursive case. Here is a function, with descriptions of what they are supposed to do. They are incorrectly implemented. Replace the incorrect implementations of these functions with correct ones that use recursion in a useful way: your solution must not use the keywords while, for, or goto. You must not use global variables or variables declared with the keyword static, and you must not modify the function parameter lists. You must not use any references or pointers as parameters except for the parameters representing arrays. //Returns the number of occurrences of digit in the decimal //representation of num. digit is an int between 0 and 9 //inclusive ////Pseudocode Example: //countDigit(18838, 8) = > 3 //countDigit(55555, 3) = > 0 //countDigit(0, 0)0 or 1 (either if fine)// int countDigit(int num, int digit) { return -1;//This is incorrect. }