Study the following definition of function "Secret" and answer the question below. int Secret (int numl, int num2) if (numl < 0) 一 for (int i = 1; i <= numl; i++) num2 num2 * i; return num2; else if (num2 > 0) for (int i num1 = numl =0; i <= num2; i++) return num1; return 0; What is the output of the following code segment? cout<

In this small funtion, identify and define each part of the functionint addition (int a, int b)  {  int r;  r=a+b;   return r; }

4. Which function calls would provide the most helpful test of this function? Remember: With tests, you are attempting to figure out all the possible ways the function could be broken. function findMin(num1, num2){ if(num1 < num2){ return num1; } else { return num2; } } function findMin (num1 num2 if( numl < num2 ) return numl } else ( return num2 O A. findMin(-1, 0) findMin(2,4) findMin(5,10) Ов. findMin(5,3) findMin(7,2) findMin(5,1) O C. findMin(1,1) findMin(-2,2) findMin(0,3) O D. findMin(-1,1) findMin(1,-1) findMin(1,1)

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.