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 $($T$\_$serial$)$ and parallel runtime $($T$\_$parallel$)$ for the multiplication on a n$\backslash$times n matrix using p processors: