A graph GV,E) is called a triad if it is the union of three non-overlapping biconnected graphs G ( VE), G2(V2, E2), and G3(V3, E3), and with three additional edges {(x1,x2),(x1,x3), (x2,83)} for some three nodes X1,x2,X3 where xV1, K2 V2, X3 13. See the figure below. (x2 G2 Saved G X3 G3 Write an algorithm that takes as input an arbitrary undirected graph G, and returns whether G is a triad. Give the time complexity of your algorithm. Hint: Observe that x1,x2,X3 are the only articulation points in G, and make use of graph traversal techniques. A graph GV,E) is called a triad if it is the union of three non-overlapping biconnected graphs G ( VE), G2(V2, E2), and G3(V3, E3), and with three additional edges {(x1,x2),(x1,x3), (x2,83)} for some three nodes X1,x2,X3 where xV1, K2 V2, X3 13. See the figure below. (x2 G2 Saved G X3 G3 Write an algorithm that takes as input an arbitrary undirected graph G, and returns whether G is a triad. Give the time complexity of your algorithm. Hint: Observe that x1,x2,X3 are the only articulation points in G, and make use of graph traversal techniques