Question $5(1\mathrm{.}5$ pts$)$

$1)$ In the Graph above, D$,$ A$,$ B$,$ F$,$ E$,$ C is a valid topological sort. True$/$False$?$

$2)$ Which of the following is NOT a requirement of the graph for topological sorting?

$-$ The graph must be acyclic.

$-$ The graph must be directed.

$-$ The graph must be weighted.

$3)$ For a directed, acyclic graph, only one possible topological sort output exists. True$/$False$?$

Question $6(1$ pt$)$

Write the Topological sort order for the granhs below.