Suppose G$=($V$,$ E$)$ is an undirected graph. An edge $($u$,$ v$)$ in E is called a bridge if and only if its removal will increase the number of connected components of the graph. Equivalently, an edge $($u$,$ v$)$ is a bridge if and only if $($If there is more than one correct choice, then select the red choice.$)$ a$.$ both vertices u and v are articulation points of G$.$ b$.($u$,$ v$)$ is a DFS tree$-$edge and there is no back$-$edge $($x$,$ y$)$ such that x is a DFS descendant of both u and v$,$ and y is a DFS ancestor of both u and v$.$ c$.$ More than one of the other choices are correct. d$.($u$,$ v$)$ is not a DFS back$-$edge, and neither u nor v is DFS root nor a leaf.