Determine how many times the output statement is displayed in each of the following fragments. Whether the algorithm is O(n) or O(n²).

0. for (int i=0; i

for (int j=0; j

System.out.println(i + +j);

2. for (int i=1; i <=10; i++)

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

if (j % i == 0)

System.out.println(i + +j);