Question 3: Let G - (V, E) be a directed acydlic graph. We snay that l ath trom tto if for every pair of distinct vertices u,v V, we have that there is a d v or there is a directed path fro design an algorithm running in odVI+IED time to determine whether (Hint: First construct examples of directed-acyclic graphs on fi linear order) connected and that aren't. Determine what property (with resp distinguishes them.) Answer: to path from u m v to u in G. Given G in the adjacency list representation, G is semi-connected. four vertices that are semi