Topological sort is an algorithm used to linearly order the vertices of a directed graph so that for every directed edge (u, v), vertex u comes before vertex v in the ordering. It applies only to directed acyclic graphs (DAGs) since cyclic graphs cannot have a valid topological ordering, since dependencies cannot be resolved. Further, multiple valid topological sort orders can exist for a given DAG. write the topological sort order of the following graph. What unusual do yo observe? Explain the reasons, and write down the partial topological sort orders. O D