A vertex u in a directed graph is defined as a black-hole vertex if there is an edge from every other vertex to u, and there is no edge from u to any other vertex. Given the adjacency matrix representation G, design an algorithm to decide if G contains a black-hole vertex. Your algorithm should run in O(|V|) time. (The time to load the adjacency matrix does not count towards to the running time.)