state big O or big theta complexity explain please

while (n > 0) System.out.println ("HELLO WORLD"); n -2 e) private int foo) ( int count=0; for (int i-0: i 10) break; else count++i return count