Consider the following code: int even = 0; int odd = 0; for (int i = 0; i < N; i++) { if (a[i] % 2 == 0) even++; else odd++; } How many increment operations as a function of input size N?