a There are two bridges b There is one bridge c There are no

a. There are two bridges.

b. There is one bridge

c. There are no bridges because the graph is not connected.

d. There are no bridges because if any edge were removed, the graph would still be connected.

There is only one bridge i.e. B-E, since the removal of that edge will make the graph disconnected

Hence there is only one bridge

Hence the most accurate answer is B