Which of the following is true about a topological sort for a dependency graph?a$.$ Each dependency graph must have one unique topological sortb. A topological sort is purely deterministicc. A topological sort can have cycle$($s$)$d$.$ A dependency graph can have many topological sorts