For each of the following code segments, calculate its respective total number of executed operations and finally state its time complexity in Big Oh notation: a) for (int i = 0; i < arr_size; i++) { int count = 0; for (int j = 0; j < arr_size; j++) { if (arrlil arr[j]) count++; int x scan.nextInt(); for (int i = 0; i < (size - 1); i++) { for (int j = (1+1); j < size; j++){ if (A[i] A[j] == x) { System.out.println("Pair with a given sum x+" is ("+ A[i] + Aljl")"); } } C) int i; int rem[x]; for (i = 0; i < x; i++) { rem [1] = 0; } for (i = 0; i