Consider the following graph: Does the graph have an Euler path? Does the graph have an Euler circuit?; Select all (but only) those options which apply to this graph. The graph has an Euler path. The graph has an Euler circuit. O The graph has neither an Euler path nor an Euler circuit. The graph has both an Euler path and an Euler curcuit.

A graph is biconnected if every pair of vertices is connectedby two disjoint paths. An articulation point in a connected graph is a vertex that woulddisconnect the graph if it (and its adjacent edges) were removed. Prove that any graphwith no articulation points is biconnected. Hint : Given a pair of vertices s and t and apath connecting them, use the fact that none of the vertices on the path are articulationpoints to construct two disjoint paths connecting s and t.

Please solve it in your own way. Do not copy chegg or others methods /