Convert the following function to one that uses recursion. void sign(int n) { while (n > 0) cout << "No Parking\n";  n−−;  } Demonstrate the function with a driver program.

Define Arrays as Parameters to Functions.

Consider the function void modify(int & x) { x = 10; }Show how to call the modify function so that it sets the integer int i;to 10.

Data Structures and Algorithms in C/C++ a) Implement the addLargeNumbers function with the following prototype: void addLargeNumbers(const char *pNum1, const char *pNum2); This function should output the result of adding the two numbers passed in as strings. Here is an example call to this function with the expected output: /* Sample call to addLargeNumbers */ addLargeNumbers("592", "3784"); /* Expected output */ 4376 b)  Implement a test program that demonstrates adding at least three pairs of large numbers (numbers larger than can be represented by a long). c) (1 point) Make sure your source code is well-commented, consistently formatted, uses no magic numbers/values, follows programming best-practices, and is ANSI-compliant.