Strassen's algorithm improves on the efficiency of a conventional divide and conquer approach to matrix multiplication by reducing the number of sub$-$problems at each level of recursion. What is the number of sub$-$problems for each problem in the algorithm?

$1$

$6$

$2$

$5$

$8$

$3$

$4$

$7$