Good morning! Here's your coding interview problem for today. This problem was asked by Mozilla. A bridge in a connected (undirected) graph is an edge that, if removed, causes the graph to become disconnected. Find all the bridges in a graph.