Use network matrices to answer the following a) How many ways can you get from Honey bridge to connecting bridge by crossing only one of the other bridges? b) How many ways can you get from Blacksmith bridge to connecting bridge without crossing more than one of the other bridges? c) Is it possible to travel from Wooden bridge to Green bridge without crossing at least two other bridges?

Blacksmith Bridge Honey Wooden Bridge Bridge D E G Merchants C Bridge A T B High Green Bridge Bridge Connecting Bridge