c++ programming questions:

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. a) j b) 10 c) k * t d) 10 * t 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 loop on j requires _____ time units. a) 10 * t b) (10 * t) + i c) 10 * t * i d) t * i Which of the following can be used to compare two algorithms? a) growth rates of the two algorithms b) implementations of the two algorithms c) test data used to test programs which implement the two algorithms d) computers on which programs which implement the two algorithms are run Algorithm efficiency is typically a concern for _____. a) small problems only b) large problems only c) medium sized problems only d) problems of all sizes