Give the runtime complexity for each of the following code fragments in Big-O notation :

int sum = 0; int X = 100000; for (int i = 1; i <= 4 * N; i++) { for (int j = 1; j <= X + 2; j++) { sum++; } for (int j = 1; j <= X * 100; j += 2) { for (int k = 1; k <= X * X; k++) { sum++; } } sum++; } System.out.println(sum);