Strongly Connected Components Homework 2.04 Give an example of a directed graph for which the SCC algorithm gives the wrong SCCs if the second depth-first search is performed on G instead of on GT. Assume the finishing-time stack is still used by the second dfsSweep. A graph of 56 vertices shoud be sufficient to make this counter-example. Strongly Connected Components Homework 2.04 Give an example of a directed graph for which the SCC algorithm gives the wrong SCCs if the second depth-first search is performed on G instead of on GT. Assume the finishing-time stack is still used by the second dfsSweep. A graph of 56 vertices shoud be sufficient to make this counter-example