in Python

Problem 5 - Electricity Grid Let G be a an undirected connected graph representing the grid connecting electric plants. Write a function that checks whether this grid can function if some connection is removed. In other words, your code should check whether the removal of any edge will leave the graph G connected. Provide an efficient algorithm. For example: graph: a--- 1 1 1 C--- alwaysConnected(graph) # returns True graph: a b 71 | b-ji 1/ h alwaysConnected(graph) # returns False (since the removal of edge b-j will leave the graph unconnected)