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

Answer Should be A

Using master's theorem it falls in first catagory which will eventually evaluate to O(n^{2})

Abhishek_g why not D.