$(5$ points$)$ Strassen's recursive algorithm for matrix multiplication hinges on using $7$ multiplications $($instead of $8$ as in the traditional, iterative algorithm$)$ to multiply a pair of $2$ by $2$ matrices. Is it theoretically possible in the future to reduce this number, $7,$ to less than $4($for example, $3)$ in multiplying a pair of $2$ by $2$ matrices? Answer Yes, or briefly explain why not.