Quiz: Longest Flight Route Pattern

Longest Flight Route: Find the longest path from city $1$ to city $n$ in a DAG. Why can't you use BFS here?

1. A.BFS only works on trees
2. B.BFS cannot handle directed graphs
3. C.BFS finds shortest paths, not longest paths
4. D.BFS is too slow for this problem