Q:Question:do this, please 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. For example, given the following DAG: One topological sorting for the given graph is "a,b,c,f,e, \( d \) ". Note that there could be more than one topological sorting for a graph ("f,a,e,b,c, \( d \) " is also a valide topological sorting). In ourA:Answer:See a step by step answer