Based on theoretical analysis of the complexity of the serial algorithm and the parallel algorithm for matrix$-$vector multiplication, you have derived the following expected serial runtime $()$ and parallel runtime $()$ for the multiplication on a matrix using processors:

The parallel runtime is composed of the parallelized computation $(),$ the unparallelized computation $(),$ and the parallel overhead $().$

Please compute the expected speedup and efficiency in the two tables below: