A student develops a technique to multiply
two 2×2 matrices. The technique requires six
multiplications. The complexity of the module that
combines the module is O(n2). Then the recursive
equation depicting the complexity of the algorithm is
(A) T(n) = 6T(n/3) + O(n2)
(B) T(n) = 6T(n/2) + O(n2)
(C) T(n) = 6T(2n ) + O(n2)
(D) T(n) = T(n/2) + 6 O(n2)