Take the adjacency matrix of a directed graph A shown below. Write a MATLAB program to graphically visualize the graph. On the graph you visualized, (i) check if you can visually find any cycles; (ii) implement Acyclicity test algorithm using MATLAB program and conduct an Acyclicity test; (iii) create your own larger adjacency matrices and conduct an Acyclicity test.

The following command(s) in MATLAB version 2016a can be used to visualize the graph:
view(biograph(DG))
To check if a graph is Directed Acyclic Graph the following command can be used:
graphisdag(DG) ,
where DG is and N-by-N sparse matrix that represents a directed graph. Nonzero entries in
matrix DG indicate the presence of an edge.