What is the order of complexity of this code snippet? (Use ^ to indicate "power of". For example, N^5 means N5.) for (int j=N;j> 0; j = j/10) { } System.out.println (j); A