II. (3 points, Show the details of your work) Given the following code snippet, calculate the theoretical time complexity by counting the number of multiplications (as basic operation) done by the code. State and prove the Big-Oh complexity of the code. Product Smaller = 1; for (index = 0; index <>