(b) Consider the following two loops:

// Loop A for(i=1; i<=n; i++) for(j=1; j<=10000; j++) sum = sum+j; // Loop B for(i=1; i<=n; i++) for(j=1; j<=n; j++) sum = sum+j;

Although Loop A is O(n) and Loop B is O(n^2), Loop B can be faster than Loop A for small values of n. Design and implement a Java program, named Ex2_4_B, that experiments to find a value of n for which Loop B is faster. Put output results as comments in your program.

I no that loop B will be faster if n^2 < 10000*n, I need help designing and implementing the program.

(c) Repeat the previous part (by naming your class Ex2_4_C), but use the following for Loop B:

// Loop B for(i=1; i<=n; i++) for(j=1; j<=n; j++) for(k=1; k<=n; k++) sum = sum+k;