second photo has all needed info

these are some clear photos

cursiX https://blackboard.angelo.edu/webapps/assessment/take/launch.jsp?course_assessment_id=_135632_18.course_id=62106_18 Question Completion Status QUESTION 17 How many instances of the function myRecursion are created in the evaluation of my Recursion (myArray, 0, 20, 36)? QUESTION 18 What is the value of myRecursion (myArray, 0, 20, 43)? QUESTION 19 How many instances of the function myRecursion are created in the evaluation of myRecursion (myArray, 0, 20, 43) QUESTION 20 What is the value of myRecursion (myArray, 0, 20, 47)? QUESTION 21 How many instances of the function myRecursion we created in the evaluation of myRecursion (MyArray, 0, 20, 47) QUESTION 22 What is the value of myRecursion (myArray, 0, 20, 59)? QUESTION 23 Click Save and submit to see and submit. Click Save All Answers to see all answers Recursic X A https://blackboard.angelo.edu/webapps/assessment/take/launch.jsp?course_assessment_id_135632 18 course ide Question Completion Status Use the code segments below as you answer this and the next eleven (11) questions. Given the following function int myRecursion (int array[], int first, int last, int val) int num; if (first > last) return -1; num (first + last) / 2; val) if (array(num] - return num; if (array(num) last) return -1; num = (first + last) / 2; if (array[num] == val) return num; if (array[num]