Made easy test series

Question

Consider the following problem:
Problem: Find longest path from a given vertex s to a given vertex t in weighted directed acyclic graph with edge weight may be negative or positive.
Which of the following technique suits to solve above problem efficiently?

A) Divide and Conquer

B) Greedy Technique

C) Dynamic Approach

D) Any of the above

Comments

I think dynamic approach will be benificial for DAG. Because it might have negative weight cycle due to negative edges. And hence greedy will fail