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.

a. for (int j = 0; j < 100000; j++) {cout << j << endl; }

b. for (int j = 8; j < n 3; j++)

{

cout << j * j << endl;

if (n / 2 > j)

cout << j * n << endl;

}