BIG O complexity. Can someone explain in detail the solution. Thank you

Cosider the following lines of codes and compute the overall complexity -

for (int i = 1; i * i < n; i += 2)

{ // Do Something

}

for (int j = 1 ; j < n ; j *= 2)

{ // Do Something

}

O(sqrt(n))

O(n²)

O( log(n))

O(sqrt(n)*log(n))

None of the above