This conceptual problem is based on Easley & Kleinberg, Ch$.13,$ The Structure of the Web. It's pretty

easy once you have read the chapter. In the graph shown,

$($a$)$ Which vertices constitute the largest Strongly Connected Component of this graph?

$($b$)$ Which nodes belong to the sets IN and OUT, and which are the "tendrils" $($section $13\mathrm{.}4)?$

$($c$)$ Name a directed edge you could add to the graph to increase the size of the SCC by the maximum

possible, and list the nodes added to the SCC$.$

$($d$)$ Name a directed edge you could delete from the original graph to increase the size of OUT by the

maximum possible, and list the nodes added to OUT.

$($e$)$ Name a directed edge you could delete from the original graph to increase the size of IN by the

maximum possible, and list the nodes added to IN$.$