Question $1$: Circle True $/$ False. Explain briefly.

a$)$ T F $[5$ points$]$ Every directed acyclic graph has exactly one topological ordering.

b$)TF[5$ points$]$ If all edges in a graph have distinct weights, then the shortest path between

two vertices is unique.

c$)TF[5$ points