The following codes must be done in C++

1. 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; What is the Big O of each loop? Design and implement an experiment to fi nd a value of n for which Loop B is faster than Loop A.

2. Repeat the previous project, 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 <= j; k++) sum = sum + k;