$2$ Part$2$: Strassen's algorithm for matrix multiplication.

Design $($Java$)$ the required modification neede in Strassen's algorithm to multiply $nn$ matrices in which $n$ is not an exact power of $2.$

Apply the same to compute a matrix product for two $33$ matrices given below.

$\left[\begin{array}{ccc}1& 2& 3\\ 4& 5& 6\\ 7& 8& 9\end{array}\right]x\left[\begin{array}{ccc}9& 8& 7\\ 6& 5& 4\\ 3& 2& 1\end{array}\right]$

Show that the resulting algorithm runs in time $(n^{lg7}).$