(A) Consider the following algorithm for computing a topological sort of a DAG G: add the vertices to an initially empty list in non-decreasing order of their indegrees. Either argue that the algorithm correctly computes a topological sort of G, or provide an example on which the algorithm fails.

(B) Can the number of strongly connected components of a graph decrease if a new edge is added? Why or why not? Can it increase? Why or why not?

(C) What is the minimum number of strongly connected components that a directed acyclic graph (DAG) on n nodes can have? What is the maximum number? Justify your answers.