Q:Question:Directed Acyclic Graph from the file and perform topological sort on the graph: - Output the sorting result if topological sorting is possible. - Otherwise, output "Topological sort is impossible". - Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge \( (u, v) \), vertex \( u \) comes before \( v \) in the ordering (topological Sorting for a graph is not possible if the graph isA:Answer:Code : #include #include #inclu...