Write a pseudo algorithm findBridges(int A[][], int N) to identify all bridges/cut edges from an undirected graph with N vertices, and for which the adjacency matrix A is used to store all edges in the graph. You may make using of the methods BFS(vertexType v) and DFS(vertexType v) that have already been defined for breadth/depth-first search to return the set of all vertices in the connected component containing vertex v. Hint: apply BFS or DFS to the two vertices of any edges