Problem 1. Calculate the Big-O time complexity for 100n log₃ n + n³ + 100n

problem 2.

Count the number of operations and the big-O time complexity in the worst-case and best-case for the following code int small for

int small

for (int i = 0; i < n; i ++)

{

if ( a [ i ] < a [0] )

{ small = a[ i ];

}

}

problem 3.

Calculate the Big-O time complexity for the following code and explain your answer by showing all calculation.

for ( int i = 0; i < n; i ++)

{

for ( int j = 0; j < n*n; j ++)

{

cout <

}

}