B) {d, e}
If we remove d-e edge then there is no way to reach e and the graph is disconnected.
An edge is a bridge iff removal of edge disconnects the graph
or
An edge is a bridge iff removal of edge increases the number of connected components. This variation is used in disconnected graphs.