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

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
}
}
}
a. j
b. 10
c. k * t
d. 10 * t

d. 10 * t