Determine the number of arithmetic operations (additions and multiplications) for computing a determinant of a square matrix of order n  N using the recursive Laplace rule. 

How much time it would take to carry out this computation on a computer capable of performing as many as 1 Peta-flops, i.e., 1015 floating-point operations per second?