The determinant of an n × n matrix denoted det A, can be defined as a00 for n...

The determinant of an n × n matrix

denoted det A, can be defined as a₀₀ for n = 1 and, for n>1, by the recursive formula

a. Set up a recurrence relation for the number of multiplications made by the algorithm implementing this recursive definition.

b. Without solving the recurrence, what can you say about the solution’s order of growth as compared to n!?