thanks in advance for your help, I really appreciate

Question 2 (2 points): When an adjacency matrix representation of a directed graph is used, most graph problems require time 12(n"), but there are some exceptions. In a directed graph G = (VE) (without parallel edges and self-loops) a vertex v EV is called a brain if out-degree() = n - 1 and in-degree(v) = 0. (1) Show that any directed graph G = (V, E) (without parallel edges and self-loops) has at most one brain. (2) Design an O(n)-time algorithm that determines if a directed graph G = (V. E) (without parallel edges and self-loops) represented by an adjacency matrix has a brain. Provide brief arguments behind the correctness of your algorithm