Consider a problem in which roads are to be built that connect all four cities a, b, c, and d to one another. In other words, after the roads are built, it will be possible to drive from any one city to another. The cost (in millions) of building a road between any two cities is provided in the following: Cities a B c D
a 0 30 20 50
b 30 0 50 10
c 20 50 0 75
d 50 10 75 0
Using this table, find a set of roads of minimum cost that will connect the cities.

solution:

→c= a b , that is product of a and b is possible only when when a is m × n matrix and b is n × p matrix.

that is, number of columns of a= number of rows of b.

so, size of matrix , c= a b is , if a = (m × n)matrix

b= (n × p)matrix

then a b = [ (m × n)matrix] ×[   (n × p)matrix ]

→→c= a b= [m × p ] matrix

→→size of product a b will be equal to = number of rows of a × number of columns of b

multiple all that

step-by-step explanation:

27×17

there are infinitely many solutions.