(Choose 1 answer)
(See picture)
A. 25
B. 5
Given the algorithm
Procedure NMT (a11,812,...., ann,b11,612,..., bnn: integer)
C. 125
for i:=1 to n do
D. 250
E. 1
for j:=1 to n do Cij:=0;for i:=1 to n do for j:=1 to n do for k:=1 to n do Cij:= Cij+aik*bkj;
If n=5, how many multiplications are required?
Rsh
Q: 11
