A single processor has to execute a program which involves the sum of $100$ floating point scalars, and a floating$-$point multiplication of a $40$x$40$ matrix. An NxN matrix multiplication requires N$2(2$N $1)$ floating point operations. Assume all floating$-$point operations take the same amount of time tfp$.$

a$)$ What would be the speedup if $40$ processors are used to execute the same program?

b$)$ What would be the speedup if $80$ processors are used to execute the same program?

c$)$ Is this a strong scaling or weak scaling system?