PLEASE HELP WITH THE C++ QUESTION. THANKS

Consider an algorithm that contains loops of this form:

for (i = 1 through n)

{ for (j = 1 through i)

{ for (k = 1 through 10)

{ Task T

}

}

}

If task T requires t time units, the innermost loop on k requires ______ time units.

Select one:

a. 10

b. j

c. 10*t

d. k*t