Determine how many times the output statement is displayed in each of the following fragments. indicate whether the algorithm is o(n) or o(n2).

a. for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) system. out. println(i + " " + j);

b. for (int i = 0; i < n; i++) for (int j = 0; j < 2; j++) system. out. println(i + " " + j);

c. for (int i = 0; i < n; i++) for (int j = n - 1; j > = i; system. out. println(i + " " + j);

d. for (int i = 1; i < n; i++) for (int j = 0; j < i; j++) if (j % i == 0) system. out. println(i + " " + j);