Consider an algorithm that contains loops of the form:

for (x = 1 through n ) {
for (y = 1 through x) {
for (z = 1 through 10 ) {
Task T
} // end for
} // end for
} // end for
If task T requires t time units, the loop on y requires ______ time units.
a) 10 t
b) (10 t) + x
c) 10 t x
d) t x

D