Show that, given a directed graph already stored in adjacency matrix form, determining if there is a vertex with in-degree |V|-1 and out-degree 0 can be done in O (|V|) time where |V| is the number of vertices within the graph.