Problem:
Question 1- Given the recurrence T(n) = 3T(2n/3) + n, and T(1) = 1, draw a recurrence tree to estimate an upper bound for T(n).
Please show all the calculations step by step.
Question 2- Write a 32-bit Assembly program with a LOOP AND INDEXED ADDRESSING that calculates the sum of all gaps between successive array elements.
The array that MUST be used is:
dwarray dword 0,2,5,9,10
So, the gaps would be 2, 3, 4, and 1, which equals 10.
Write the code step by step and explain it.