Write a recursive function that mimics (without the use of <<) the left shift operator and returns the result from the two given integers. Examples shiftToLeft(5, 2) → 20 shiftToLeft (10, 3) -80 shiftToLeft (-32, 2)-128

Write a recursive C function that returns the uppercase letters of the string named str by storing them in the cap variable. The prototype of the function should be: void F (char * str, * char cap);   we use devC   ASAP

Write a recursive function called Rev takes a string argument (str) and and integerargument(i – the initial string position). Rev prints the str in reverse. You may not useany built-in reverse function or method. You may use string’s length method.

Given the recursive function definition:t(n) = n+ 3 * t(n-1) + t(n-2) t(0) = 2 t(1) = 1a. Evaluate: t(3)b. Write the source code to implement this function

What is the return value of the function call Comp(3, 4), given the recursive function Comp defined below:     int Comp(int a,  int b)  {            if (a + b <= 5)                  return 2;            else                  return Comp(a-1, b) + Comp(a, b-1);     }   Question 6 options:   6   10   12   8

describe a recursive function that cannot be rewritten as non recursive

Write a recursive function (Java) called Fac which takes one positive integer argument (n) and returns n! You may not use a built-in factorial method or function.

SML programming Write a recursive function np(n) which takes a non negative n and  generates a list of numbers from n+1 down to 0. You may assume that input of n is always valid. Must use identical function name and parameter(s). np(4)⟶[5,4,3,2,1,0]

in c++

Please solve this in C programming language as early as possible. .Write a recursive function that can use to add all the numbers from 5 to n, where n>5. n will be given by the user. Prototype: int add_num(int n);