6. Analyze the complexity of each of the following code fragments and state the complexity (big O or ) for each: a) for (int i=0; i < n; i++) for (int j=0; j < n; j++) for (int k=0; k < 10; k++) for (int 1=0; 1 < n; i++) for (int m 0; m < n; m++) int numi+j+(k+1)-m; d) private int some Function () { int count = 0; for (int i=0; i < n; i++) count++; for (int j=0; j < n; j++) count++; for (int k=0; k < n; k++) count++; return count; b) while (n > 0) { System.out.println("LOOP"); n /= 2; } c) private String aFunction (int n) { if (n 0) return null; if (n=1) return "A"; else if (n-2) return "B"; else if (n=3) return "C"; else if (n==26) return "Z"; else return null; e) private int foo () { int count=0; for (int i=0; i < n; i++) if ( i > 10) break; else count++; return count;