1. (7 pts) T(n) = 3.5.T(n/2) + f(n), where f(n) O(n). Use the master method to solve T(n). You need to specify a, b, log, a, and decide the case (with sufficient supporting argument for the decision of the case). You also need to write the derived conclusion. 2. (7 pts) T(n) = 3.T(n/2) + 8n + n log n. Use the master method to solve T(n). You need to specify a, b, log, a, and decide the case with sufficient supporting argument for the decision of the case). You also need to write the derived conclusion. 3. (8 pts) T(n) = 7. T(n/2) + n. Use the master method to solve T(n). You need to specify a, b, log, a, and decide the case (with sufficient supporting argument for the decision of the case). You also need to write the derived conclusion. 4. (7 pts) Let A be an array of 5 integers, whose contents are as follows: 6, 4, 2, 10, 8 We will apply insertion sort to sort this array. Show all of the element-wise comparisons made by the algorithm in the correct order. Here an element-wise comparison means the comparison of one element of the array with another element of the array or the key set in a particular step of the algorithm. Since the algorithm may move the elements of the array, you need to show the values of the elements being compared (rather than the form of Ail). The first element-wise comparison is 6 > 4