This Bonus Question is worth 10 points if answered correctly…

This Bonus Question is worth 10 points if answered correctly, and will be added to any final score which you earn from the base 100 points possible.  If you choose not to attempt it, then it will not take any points away from the base 100 points which you can earn (i.e. it will add “0”, as listed on Canvas). Give a linear time algorithm for the maximum subarray problem.  Also justify the correctness and time complexity, at least informally.  Hint:  Solve A[1 … j+1] using information from the solution of A[1 … j].  You may need more than just the optimum solution for A[1 … j].

In this question, you will construct the max heap that resul…

In this question, you will construct the max heap that results from using BUILD-MAX-HEAP to create a heap from the following array:  . Step 1 is constructing the initial heap.  Fill in tree which results after constructing the initial heap below. [A5] / \ [A8] [A12] / \ / \ [A7] [A3] [A11] [A9] / \ / \ [A6] [A2] [A4] [A10]    

In this question, you will find the maximum subarray of the…

In this question, you will find the maximum subarray of the array A = [1, -2, 8, -25, 3, 4, -1, 3] using the θ(nlog(n)) divide and conquer algorithm discussed in class. Step 6: Use Master Theorem to demonstrate how the asymptotic bound θ(nlog(n)) is achieved for T(n) given in Step 5.  (Note: T(n) must be correct in order to receive credit in this step.)