Topological sort algorithm for Directed Acyclic Graph (DAG) is a linear arrangement of vertices such that for every directed edge x-y, vertex x comes before y in the arrangement. Topological sorting is only applicable on graphs that are DAG. Now your task is to prove that from the above graph that, "There can exist more than one topological sorting for a given graph." Using i. DFS ii. Kahn's Algorithm