A bridge (sometimes called a cut edge) is an edge in a graph whose removal increases the number of components of the graph. A bridge might represent a critical link in a nctwork or transportation network that would harm the entire system if it went down or were attacked. Edge (c, d) in the graph below is a bridge Notably, it can be shown that an edge in a graph is a bridge if and only if it does not belong to a cyclc 1. Describe pseudocode for an algorithm that returns all bridges in a given graph. Hint: you will want to modify DFS so that it marks all cdges that belong to cycles. I would recommend that you modify the standard recursive DFS to maintain parent pointers for the traversal trec. Every non-tree-edge in a DFS (or BFS) traversal defines a cycle of the graph, so "all you nocd to do" is to mark the edges that bclong to this cycle when you cncountcr a non-trec-edge of the traversal troc Pseudocode for DFS with parent pointers appears below