1. Prove, disprove (give a counterexample, highlight the incorrectness or give the correct answer) or complete a proof. (d) Let tree T be the result of applying depth-first search to a connected graph. Then a non-root v of T is a cut-vertex if and only if v has a child w such that low(w) > dfnumber(v)