pls solve fast

8. (5 marks) The Euler circuit/path and the Hamilton circuit/path can easily be extended to directed graphs as well a) Formulate a necessary and sufficient condition for a directed graph to have an Edler circuit b) Formulate a necessary and sufficient condition for a directed graph to have an Exiler path c) Does the graph below have an Euler circuitor path? Explain why or why not. Show an Euler circuit/path in case it exists. d) Does the graph below have a Hamilton circuitor path? Show such a circuit path in case it exists. e) Is the graph below strongly connected? If not, what are its strongly connected components? Team Team Team Toam Team Team FIGURE 13 A Graph Model of a Round-Robin Tournament