4. Consider the following program and recursive function. #include void Z(int[], int, int); void swap (int&, int&); void main() { int A[3]={1,2,3}; int n=3; Z(A, n, 0); } void swap(int int temp, temp = x; x = y; y = temp; int &y) { void Z(int A[], int n, int k) { if (k == n-1) { } else { for (int i=0; i

c programming Task 3: Complete armstrong_task3.c by implementing armstrong_recursive function. int armstrong_recursive (int arm); It performs same operation as in Task 1, however in a recursive manner. A number to be checked whether it is armstrong or not is given as an input and the function returns the summation of the digits. If the returned value is equal to the given input value then it is an armstrong number.

code in C

Consider the function definition:  void GetNums(int howMany, float& alpha, float& beta) {   int i;   beta = 0;   for (i = 0; i < howMany; i++) {     beta = alpha + beta;   } } Describe what happens in MEMORY when the GetNums function is called.