Computational cost of computing a matrix determinant

(note: flops = floating point operations)

Can I have help with b) in particular please? Thanks

(a) Determine the number of floating point operations required for calculating the determinant of an n x n matrix using a straightforward implementation of the recursive definition of the determinant. Y ou can combine additions and multipli cations. Hint: consider the number of flops done on each recursive level separately. How many determinants are to be computed on each recursive level? On each recursive level, how many flops does it take to compute each of these determinants? (By us- ing determinants that are one size smaller, computed on the next recursive level Then sum up over all the levels (give the result as a sum like 2...). (b) Find an approximation for the expression derived that is valid for large n. (Hint this approximate result should be a very simple expression, proportional to n and you will need expr 1 +z r2/2! /3! /4