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 an experiment to find the largest value of n for which Loop B is faster.