Please also explain why

Select the order of growth for the following algorithm. statement1

for i=2 to n-1 {

if(condition1) {

for i=1 t n

statement3

} else {

statement3

}

statement5

}

statement6

O( n )

O(n²)

O(n³)

O(n⁴)

O(nlogn)

O(logn)

none of the above