Let G = (V, E) be a directed graph. A black hole is a vertex u E V such . all vertices u u have an outgoing edge (u,v) leading to v and v has no outgoing edge. (a) Prove or disprove: i a directed graph, there is at most one black hole