Consider an Algorithm That Contains Loops of the Form: for (X

Multiple Choice

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 innermost loop on z requires ______ time units.

A) y
B) 10
C) z * t
D) 10 * t