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 3: Give the total sum (i.e. a number) which is the sum of values from the maximum subarray.

In this question, you will construct the max heap that results from using BUILD-MAX-HEAP to create a heap from the following array:  . Steps 1-2 were performed above.  Now perform step 3: Step 3.  Fill in the tree which results after the second exchange is performed.   [C5] / \ [C10] [C12] / \ / \ [C7] [C8] [C11] [C9] / \ / \ [C6] [C2] [C4] [C3]  

In this question, you will construct the max heap that results from using BUILD-MAX-HEAP to create a heap from the following array:  . Steps 1-4 were performed above.  Now perform step 5: Step 5.  Fill in the tree which results after the fourth exchange is performed. The tree is the finished max heap in the pointer representation.   [E12] / \ [E10] [E11] / \ / \ [E7] [E8] [E5] [E9] / \ / \ [E6] [E2] [E4] [E3]  

Assume that you are given the following linear time algorithm: BSTNode *BuildBST(A, n): It takes an array and its size as arguments, builds a binary search tree, and returns a pointer to its root in θ(n) time. A BSTNode structure contains pointers LC, RC of type BSTNode* pointing to the left child and right child of that node respectively. Step 1: Use the above function to write pseudocode to output the array in ascending order in linear time. PrintAscending(A,n){   //Output elements of A in ascending order   //Write pseudocode below

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 2: Show how the algorithm computes the answer.

In this question, you will construct the max heap that results from using BUILD-MAX-HEAP to create a heap from the following array:  . Steps 1-2 were performed above.  Now perform step 3: Step 3.  Fill in the tree which results after the second exchange is performed.   [C5] / \ [C10] [C12] / \ / \ [C7] [C8] [C11] [C9] / \ / \ [C6] [C2] [C4] [C3]  

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 5: Give the recurrence relation for the maximum subarray algorithm FIND-MAXIMUM-SUBARRAY.  That is fill in the right hand side of the following equation: T(n) =

In this question, you will construct the max heap that results from using BUILD-MAX-HEAP to create a heap from the following array:  . Steps 1-4 were performed above.  Now perform step 5: Step 5.  Fill in the tree which results after the fourth exchange is performed. The tree is the finished max heap in the pointer representation.   [E12] / \ [E10] [E11] / \ / \ [E7] [E8] [E5] [E9] / \ / \ [E6] [E2] [E4] [E3]  

In this question, you will construct the max heap that results from using BUILD-MAX-HEAP to create a heap from the following array:  . Steps 1-3 were performed above.  Now perform step 4: Step 4.  Fill in the tree which results after the third exchange is performed.   [D12] / \ [D10] [D5] / \ / \ [D7] [D8] [D11] [D9] / \ / \ [D6] [D2] [D4] [D3]  

In this question, you will use dynamic programming to determine the longest common subsequence of   and . Step 1. Provide the recursive equation for the recurrence.  That is, complete the right hand side: c[i, j] =