Analyze the following code fragments and write down the Big-O estimates of the following code fragments. Provide a concise explanation how you got your answer.

c. for (int j = 0; j < n; j++)

{

for (int k = 0; k < n; k++)

cout << (j + k) << endl;

}

d. while (n > 1)

{

k += n *3;

n = n / 2;

}

e. int temp = n;

for (int j = 0; j < n; j++)

{

while (temp > 1)

temp = temp / 2;

}