An edge e of a connected graph is called a bridge when e is removed from the edge set, t...

An edge e of a connected graph is called a bridge when e is removed from the edge set, the resulting subgraph is disconnected. For example, the edges in the graph below that are bridges are ab, bc, and fg. Give an example of a connected graph of order 7

(a) with no bridges. (b) with one bridge. (c) with 6 bridges.