Correct option is (a) True
Explanation: Since The Coppersmith-Winograd algorithm multiplies the matrices in O(n^2.37) time. The time complexity of recursive multiplication of two square matrices by Strassen’s Method is found to be O(n^2.80). Therefore, Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity.