it is not a Big O() Question. if you don't know how to answer this question please tell me how many times each line will run in terms of n

1.Determine the running times predicted by the detailed model of the computer and the simplified model of the computer for each of the following program fragments:

for (unsigned int i = 0; i < n; ++i)

if (i % 2 == 0) //number of time this line will run in terms of n

++k; //number of time this line will run in terms of n