Compute the asymptotic complexity of the following code. Please explain how each line was determined.

i = 1;

sum = 0;

while (i <= n) {

j = 1;

while (j <= n) {

sum = sum + 1;

j = j +1;

}

i = i +1;

}