Strassen's matrix multiplication is a well$-$known divide and conquer based matrix multiplication

algorithm. It reduces the required count of matrix multiplication from $8$ to $7$ for the matrices of size $22,$

where the count of addition$/$subtraction is $18.$ It is desired to find the count of multiplication and

addition$/$subtraction needed to multiply two matrices of size $16x16$ using Strassen's algorithm.