Definition. A sink in a directed graph G -(V, E) is a verter of out-degree zero and in- degree |V - 1. That is to say, there is an edge from every other vertex to the sink and no edges starting at the sink. Design an algorithm that, given an adjacency matrix for for a directed graph G, deter- mines whether G has a sink, while examining at most O(V) bits of the matrix. Definition. A sink in a directed graph G -(V, E) is a verter of out-degree zero and in- degree |V - 1. That is to say, there is an edge from every other vertex to the sink and no edges starting at the sink. Design an algorithm that, given an adjacency matrix for for a directed graph G, deter- mines whether G has a sink, while examining at most O(V) bits of the matrix