Given the following codes:

1.

sum = 0 ;

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

for ( j = 1; j < n^3 ; j = 3*j )

sum++;

What is the time complexity (in ?-notation) in terms of n?

2.

sum = 0 ;

for ( i = n ; i > 0; i = i/3 )

for ( j = 0 ; j < n^3 ; j+=3 )

sum++;

2. Whatt is the time complexity (in ?-notation) in terms of n?