data structures using exp_rec( exp_rec( programming example write program to calculate exp( ,yusing recursive functions #include int exp_rec(intint)int main(int num num resprintf("\ enter the two numbers")scanf("% % "&num &num )res exp_rec(num num )printf ("\ result % "res)return int exp_rec(int xint yif( == return else return ( exp_rec(xy- ))output enter the two numbers result the fibonacci series the fibonacci series can be given as that isthe third term of the series is the sum of the first and second terms similarlyfourth term is the sum of second and third termsand so on now we will design recursive solution to find the nth term of the fibonacci series the general formula to do so can be given as as per the formulafib( = and fib( so we have two base cases this is necessary because every problem is divided into two smaller problems fib ( if if fib ( fib( )otherwise programming example write program to print the fibonacci series using recursion #include int fibonacci(int)int main(int ni resprintf("enter the number of terms\ ")scanf("% ",& )printf("fibonacci series\ ")for( ni+res fibonacci( )