(C++) Write a recursive function to print the following pattern. Example: Enter any number = 4 4 2 2 1 3 1 1 2 1 1 1 1

Explain in detail how this recursive function works: Program description: The program counts then number of 7's in a number   C++ code: #include <iostream>using namespace std;//definig numSevens functionint numSevens(int s){//checking if number is 0if(s==0)//returning 0return 0;//checking if last digit is 7else if(s%10==7)//returning 1 and recursively calling numSevens function for the next digitreturn(1+numSevens(s/10));else//returning 0 and recursively calling numSevens function for the next digitreturn(0+numSevens(s/10));}int main(){//calling numSevens function for a sample value and printing resultcout<<numSevens(47364778)<<endl;return 0;}

(Please provide photos so the code is easier to understand) Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function  (defun gcd (n m)"Returns the gcd of two numbers"  (let ((dividend n) (divisor m) (remainder 1))    (while (/= remainder 0)      (setq remainder (mod dividend divisor))      (setq dividend divisor)      (setq divisor remainder))    dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.

Q:1 a) Can a predefined function be recursively called by the programmer? Elaborate. b) Write a program in C to take input for an integer.If the given integer is prime then display the product of its digits otherwise check whether it is even or odd.Use minimum three functions including main function.