When an adjacency-matrix representation is used, most graph algorithms require time , but there are some exceptions. Show that determining whether a directed graph contains a sinka vertex with in-degree |V | 1 and out-degree 0can be determined in time , even if an adjacency-matrix representation is used. Show the steps of the algorithm you devised on a graph with a sink.