Suppose you are given a simple, undirected, and un-weighted graph G. A vertex v is a cut or articulation vertex if its removal disconnects two other vertices. Equivalently, all paths (in G, before removal) from u to u'pass through v. Determine if v is a cut vertex. If so, find some pair (u, u') that got disconnected. Write pseudocode for this algorithm and give a runtime analysis