1 ) What are the Time efficiency and Big-O for the following method?

void myFun(int [][]t, int n) {

int val=4;

int i,j;

for(i=0;i<=n;i*=2)

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

t[i][j] = t[i][j]+ val*i;

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

System.out.println(t[i][j]);

}

--------------------------------

2) What is the time efficiency and Big O for the following java code?

public void print(int n, int m){

for( int i=1; i<=m; i++ )

for( int j=1; j<=n; j++ )

System.out.println(n+10);

for( int i=1; i<=n; i+=2 )

System.out.println(n);

}