Most graph algorithms that take an adjacency-matrix representation as input require time (V 2 ), but there

Most graph algorithms that take an adjacency-matrix representation as input require time Ω(V²), but there are some exceptions. Show how to determine whether a directed graph G contains a universal sink-a vertex with in-degree |V| - 1 and out-degree 0-in time O(V), given an adjacency matrix for G.