Show how you count the number of operations (not only basic operations) required by the algorithm to the right, 4 points: It is OK to do this part on a sheet of paper then snapshot it. Please include the screenshot in our assignment report. Microsoft Office Lens, Adobe Scan, and Google Lens are good phone applications for this purpose. Coding is recommended but not required. Please make sure our handwriting is readable to our grader. 2. Consider Loop A and Loop B in the box to the right, 4 points: Although Loop A is O(n) and Loop B is O(n2), Loop B can be faster than Loop A for small values of n. Design and code a creative experiment to find a value of n for which Loop B is faster. Please submit both our code and our discussion. 3. Repeat question E.2 but use Loop C in place of Loop