Given a DAG $($directed acyclic graph$)$ and three vertices a$,$ b$,$ c$,$ give an

algorithm that finds if there is a directed path from a to b that goes via c$.$ Does the

algorithm work for general directed graphs?s

explain their correctness and analyze their complexity. The complexity should be as low as possible. Write the answer in pseudocode and explain as well.