What is the time complexity of the following code in Big O notation? (Describe your answer shortly.) for (int i=1; i = 0 ; j--)

What is the time complexity of the following code in Big O notation? (Describe your answer shortly.)

for (int i=1; i<=n ; i*2) { for (int j=n; j >= 0 ; j--) { System.out.print( i+ j); } }