Which of the following procedure is suitable to find the longest path from a given vertex to any other given vertex in a directed acyclic graph (weighted) with few negative edge weights.
A) Divide and Conquer
B)Greedy approach
C)Dynamic programming
D)All of these