Not entirely sure if answer is correct.

1 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. // Defines an Nadi matrix containing elements of type E template using Matrix = std: sarray<: array n>; // Determine if an Nd matrix is symmetrical along its major axis templatectypename E, std::size t N> bool 1sSymmetrical const Matrix & matrix ) { for std::size t row - @; row