Consider a directed graph with vertices 1, 2, . . . , n. Say that the graph is represented by a matrix A (hence A[ij] = 1 if ij ∈ E). Assume that there are no parallel edges no anti paralle edges, and no self loops. Give an algorithm that finds if there is a vertex with in-degree n − 1.