define the decision and optimization versions of the problem of single source longest path.considering your definition and a directed acyclic graph is there is a polynomial time solution to this problem acyclic graph contaiining n vertices and m edges?if yes then give the algorithm and analyze the running time of your algorithm if nno then prove that the decision version of the single source longest path problem on a directed acyclic graph is NP$-$complete

Answer rating: 100% (QA)

The single source longest path problem is defined as finding the longest path from a given source vertex to all other vertices in a directed graph 1 D... View the full answer