$(30$ points$)($Dynamic Programming$)$ Design an efficient algorithm for finding the length

of the longest path in a DAG $($directed acyclic graph$).$ What is the algorithm efficiency if

you implement the graph as an adjacency matrix with the size $nn?$