Matricies and Graphs program

I need to focus on matrices and directed graphs represented as adjacency matrices. C++ or MATLAB is needed to be used to perform the tasks. Thanks in advance if anyone figures this one out.

1. Roots and Leaves of a Graph (50 points Taking an adjacency matrix as input (matrix in MATLAB, 2d array in C++), return the set of roots and leaves in the graph. For example, in the graph below, the graph has roots 1,2 and leaf 7. It is possible for a graph not to have roots and/or leaves 2. Determinant (50 points) Write a function that takes as input a 2x2 matrix and a 3x3 matrix and outputs if the matrix is regular or singular. Implement two test cases for singular and regular