What is the return value of the function call BS(array, 0, 9, 45), where array is an array declared as int array[]={3, 10, 13, 20, 35, 45, 67, 77, 82, 90}; The recursive function BS is defined as: int BS(int array[], int first, int last, int value) {     int mid;            if (first > last)         return -1;     else {             mid = (first + last) / 2;             if (value == array[mid])                 return mid;             else if (value < array[mid])                 return BS(array, first, mid - 1, value);             else if (value > array[mid])                 return BS(array, mid + 1, last, value);         } }   Question 9 options:   2   3   8   5

MULTIPLE FUNCTIONS AND RECURSIVE FUNCTIONS HANDS-ON use #include<stdio.h>

Write in C++ 1. Define a struct for a soccer player that stores their name, jersey number, and total points scored. 2.Using the struct in #1, write a function that takes an array of soccer players and its size as arguments and returns the average number of points scored by the players. 3.Using the struct in #1, write a function that takes an array of soccer players and its size as arguments and returns the index of the player who scored the most points. 4.Using the struct in #1, write a function that sorts an array of soccer players by name. 5.Using the struct in #1, write a function that takes an (unsorted) array of soccer players and its size and a number as arguments, and returns the name of the soccer player with that number. It should not do any extra unnecessary work. 6.Define a function to find a given target value in an array, but use pointer notation rather than array notation whenever possible. 7.Write a swap function, that swaps the values of two variables in main, but use…

When the following program is executed, it terminates with an error. Which option best describes the cause of this error?   Question options:   The function will terminate the program due to the recursive limit being reached.   The function will terminate the program due to a type mismatch when evaluating an operator.   The function will terminate the program due to invalid syntax.   The function will terminate the program due to an invalid type conversion.   The function will terminate the program due to it accessing an invalid list index.   None of these options

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.

17: recursion.cpp) Write two recursive integer functions. The first function should calculate factorials using the definition 0! = 1 and n! = (n-1)! x n. In addition, if n is too large it should be able to detect integer overflow before it happens. The next function should calculate the greatest common factor (gcf) of two numbers. If the second number is zero, then the gcf is the other number. Otherwise, the gcf of a and b is the same as the gcf of b and a mod b.

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.