Problem 1. The algorithm A has a worst-case running time T(n) 2n+3 1) Is T(n O(n) Explain your answer 2) Is T(n) 0(2) Explain your answer. 3) Is T(n)-O(n!)? Explain your answer Problem 2 In the lecture about "Divide and Conquer" strategy we studied Strassen's algorithm for matrix multiplication, which has a running time O(n281). What is currently the best algorithm for matrix multiplication? Find a reference for the paper with that algorithm