Not entirely sure if answer is correct.

8 1 point Given the following pieces of code choose the Big O complexity. If there is more than one option, select the tightest asymptotic bound 1/ calculate the product of all non-zero elements within the Il collection. Return 1.0 if the collection is empty or contains 1/ only zero values. template<:size_t n> double f{ const std: sarray(double, N> & collection ) { double product = 1.8; for( const auto & element : collection) if( element le ) { product - element; return product; 3 O(n) O(1) O{n) Olloszn)