1. Write a recursive function to find the sum of the first n integers, i.e. the sum 1+2+3+4 + .... + n. Write a main program to test the function. Include a screenshot of the output. Verify the computer answer using the sum of first integers formula you learned in Discrete mathematics. 2. Consider the following sorted array. Search for key = 90 by applying the Binary Search algorithm. Clearly indicate the low, high and mid index in each iteration of the Binary Search and show how the mid index is evaluated. How many comparisons are done before finding the key? 0 1 a 12 17 23 38 32 2 3 4 5 6 7 8 45 45 77 F8 84 90 00