9. (basic) In the Max-Subarray problem, state the recurrence on the running time of the algorithm you learned in class and solve it using your favorite method. 10. (basic) We learned a divide-and-conquer-based algorithm for Matrix multiplication (not Strasssen's algorithm) for multiplying two n by n matrices. The recurrence on the running time of the algorithm was T(n)=8T(n/2)+O(n2) - can you explain why? Solve the recurrence. 11. (basic) In Strassen's algorithm, what was the recurrence we obtained? Solve the recurrence