Direction: Find the Big-O notation for the cost below show all work. Only Accept if you know Big-O notaion

What is Big O?

Big O notation seeks to describe the relative complexity of an algorithm by reducing the growth rate to the key factors when the key factor tends towards infinity. For this reason, you will often hear the phrase asymptotic complexity In doing so, all other factors are ignored. It is arelative representation of complexity.

2. The number of statements executed for calculating the average value of a two-dimensional array with n*n elements Statements Cost 1 float find Avg2D( int [ ][ ]a, int n) { float sum 0 int I -0; 4while (0) 12 13 14 15 16 return sum; else return 0.0f<>