this the answer, explain it please

2. [4 points] What is the Big-O complexity of the following program fragment? int j; for(int k=1;kn;k++){ for(int i=n;i>=1;i){ j=1; while(j\&=n)\{ System.out.println(i+j);j=j2; \}