Given a sequence a1, a2, ..., an, show how to calculate all partial products p1 = a1, p2 = a1a2, ..., pn = a1a2 ... an, in O(log n) ti 6. Show that the calculation of all the matrix products A2, A3, ..., An, can be done in O(log m log n) time where A is an m m matrix. How many processors are required? (It is not necessary to write pseudocode to answer this question.)