Approximate the runtime of the following code fragment, in terms of n: Write your answer in a format such as "O(N^2)" or "O(N log N)" (without the quotes).

int sum = 0;

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

 for (int j = 1; j <= n; j++) {

 sum++;

 }

}

for (int j = 1; j < 100; j++) {

 sum++;

 sum++;

}

big-oh=_____?