Consider a graph that contains 100 vertices and 7 strongly connected components. a. A is a strongly connected component consisting of 5 vertices: w , x , y , z , and t . These vertices have the following discovery and finish times: w.d = 22 , w . f = 41 , x . d = 18 , x . f = 46 , y . d = 25 , y . f = 42 , z . d = 27 , z . f = 30 , t . d = 20 , t . f = 39 . b. B is a strongly connected component consisting of 7 vertices: a , b , c , e , f , g , and h . c. There is an edge from vertex y to vertex e. 1. Based on the information given so far, which of the following is impossible (select all that apply): A. c.f = 28 B. c.f = 52 C. c.f = 10 D. c.f = 36 E. c.f = 48 F. c.f = 32 2. Suppose we are given an additional piece of information that d ( B ) = 24 . Which of the ABOVE choices is now impossible (select all that apply)..

1. Consider a graph that contains 100 vertices and 7 strongly connected components. a. A is a
strongly connected component consisting of 5 vertices: w , x , y , z , and t . These vertices have
the following discovery and finish times: w.d = 22 , w . f = 41 , x . d = 18 , x . f = 46 , y . d = 25 ,
y . f = 42 , z . d = 27 , z . f = 30 , t . d = 20 , t . f = 39 . b. B is a strongly connected component
consisting of 7 vertices: a , b , c , e , f , g , and h . c. There is an edge from vertex y to vertex e. 1.
Based on the information given so far, which of the following is impossible (select all that
apply): A. c.f = 28 B. c.f = 52 C. c.f = 10 D. c.f = 36 E. c.f = 48 F. c.f = 32 2. Suppose we are
given an additional piece of information that d ( B ) = 24 . Which of the ABOVE choices is now
impossible (select all that apply).