9. In a set up a recurrence for Q, in b set up a recurrence for the number of times multiplications are executed, and c create a recurrence for the number of times additions/subtractions are executed. In a, you can substitute a sequence of small n values, e.g. 1, 2, 3, 4, ... into your recurrence to find what the algorithm computes. 10. Use the method of characteristic equations to solve the recurrence. 9. In a set up a recurrence for Q, in b set up a recurrence for the number of times multiplications are executed, and c create a recurrence for the number of times additions/subtractions are executed. In a, you can substitute a sequence of small n values, e.g. 1, 2, 3, 4, ... into your recurrence to find what the algorithm computes. 10. Use the method of characteristic equations to solve the recurrence