(2) 1. Is the following graph strongly connected? If not, is it weakly connected?_ If not, how many connected components does it have? b a d C e (2) 2. Is the following graph strongly connected? If not, is it weakly connected? If not, how many connected components does it have? 11 10 1 2 12 3 9 8 7 5 10 (4) 3. Does the following graph contain a Hamilton circuit? If so, find one. If not, does it contain a Hamilton path? If so, find one. If not, explain why it contains neither a Hamilton circuit nor a Hamilton path. a b 0 d f blj g (4) 4. Does the following graph contain a Euler circuit? If so, find one. If not, does it contain a Euler path? If so, find one. If not, explain why it contains neither a Euler circuit nor a Euler path.