Need a well written proof with good arguments: 1. [20 points] Suppose we have a connected graph \( G=(V, E) \), and a specific vertex \( u \in V \). Suppose we compute a depth-first search tree rooted at \( u \) and obtain a tree \( T \) that incl 1 answer