need help with 12.13.14,15,16

question 17 and 18 dont have to be answered

12. What output does the following program produce? int marchint first int last. tat n) : intenint int Exercises stacout n) returnValue search first. mid-1. n): else return value = search(id+1, Tast, n): std::cout 0) 1+ (n ! 8 > 0) displayOctalin / B): std::cout and if 111 and displaystal Describe how the algorithm works. Trace the function with n=100 14. Consider the following program: Consider the following function that converts a positive decimal number to void displayOctal (int n) if (n > 0) m if (n / 8 > 0) displayOctal(n / 8): std::cout 0 int f(int n) std::cout 0 o stand Sto:cout cursexy Stocout end end Execute the function with Sandy = 3. How is the output affected fx a reference argument instead of a value argument Perform a box trace of the recursive function binarySearch, which appears in Section 2.4.2, with the atay 1.5.9. 12. 15.21.29,31 for each of the following search values 16. The algorithm all discussed in Section 2.4.4, assumes that the array contains distinct values Modify the algorithms that the array can contain duplicate values. You will need to decide whether the second smallest value in the array 778 9. for example, is 7 or 8. Although your choice is arbitrary, it will Vect your worithm Tre that you have 101 Dalmatian Dalmatians have the same number of pos Sunsthal you create y of lol integers. The first integer is the number of spots on the first Dalmatian, the second inter is the number of spots on the second Dalmatian, and so on. Your friend wants to know whether you have a Dalmatian with Thus, you need to determine whether the array contains the ituer 99 you plan to use hayanch look for the 99, what if anything would you do to the a before searching