Clearly list strongly connected components in order of discovery and show clearly the algorithm used with clear explanation for good feedback thanks.

SCC Graph Theory: Please show full explanation and clear explanation for goodfeedback and full points thanks 5. (20 points) Graph a. (10 pts) Find the strongly connected component the strongly connected components of the following graph G. List all full points. strongly connected components in the order of discovery Show steps to earn b. (10 pts) Design an algorithm that adds fewest edges to G so that G contains a single connected component. Please provide an intuition first