Let G be an undirected, connected graph, where each vertex has an additional attribute called v$.$color, which may be either black or white.

Your job is to update DFS$-$visit$($u$)$ so that it counts the total number of black nodes in the graph.

The procedure must return the total number of black nodes. Justify the runtime of O$($V $+$ E$).$