1. Prove, disprove (give a counterexample, highlight the incorrectness or give the correct answer) or complete a proof. (a) When a depth-first search is executed on a digraph, the non-tree arc can be a right-to-left arc. Proposition. Let G be a connected graph. All vertices on a cycle are in the same bridge component of G