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.

ProductSmaller = 1; for (index = 0; index < n; index++) if (Arr[index] <5) ProductSmaller = ProductSmaller * Arr[index];