Given the recursive function, answer the following five (5) questions int* foo (int *A, int n) // Line 1 int *B, i, j, p = n-1, x; // Line 2 if (n==1) return A; else // Line 3 // Line 4 // Line 5 //Line 6 // Line 7 // Line s // Line 9 // Line 10 // Line 11 // Line 12 // Line 13 x = A[n-1); B foo (A, n-1) ; i=0; while (i