Please type the answer, don't take the picture.

Please wirte the algorithm, not the code.

2. A directed graph with n vertices is called YUCCA if there is a vertex with indegree 0 and outdegree n-1. For example, the following is a YUCCA because node A has indegree 0 and outdegree n- A) Write an algorithm to test whether a graph represented as an adjacency matrix is a YUCCA. Your algorithm must examine only O (n) entries of the adjacency matrix. Justify the correctness and time complexity of your algorithm. 2. A directed graph with n vertices is called YUCCA if there is a vertex with indegree 0 and outdegree n-1. For example, the following is a YUCCA because node A has indegree 0 and outdegree n- A) Write an algorithm to test whether a graph represented as an adjacency matrix is a YUCCA. Your algorithm must examine only O (n) entries of the adjacency matrix. Justify the correctness and time complexity of your algorithm