PART 2 - The Efficiency of Algorithms, 10 points 1. Show how you count the number of operations (not only 2. Consider the following two loops, 4 points basic operations) required by the algorithm, 4 points: // Loop A for (i= 1; i = lastsum ; Although Loop A is 0(n) and Loop B is 0(n2), Loop B can be faster than Loop A for small values of n. Design and implement an experiment to find a value of n for which Loop B is faster