For the following parts, try to get the best Big-O estimate that you can and briefly justify your answers.

Part a)

int i, j;

int n = 100;

for (i = 1; i <= n; i++) {

for (j = 3*i; j <= n; j++) {

printf("programming is fun ");

}

}

Part b)

int i, j;

int n = 1000000;

for (i = 1; i <= n; i++) {

for (j = 1; j <= 10000; j++) {

printf("%d %d ", i, j);

}

}

Part c)

int i = 0;

int n = 10;

int j;

while (i < n) {

i++;

j = i;

while (i < n) {

printf("hello %d ", i);

i++;

}

i = j;

}

Part d)

int i = 0;

int n = 10;

int j;

Page 5 of 6

while (i < n) {

i++;

j = i;

while (i < n) {

printf("hello %d ", i);

i++;

break;

}

i = j;

}