(Solved): 10. We can also consider Euler paths and circuits in directed graphs or partially directed graphs. ...

10. We can also consider Euler paths and circuits in directed graphs or partially directed graphs. The arrows now indicate that we can only go in the specified direction along the edge. If there is no arrow, that means you can traverse the edge either way. Does the following multigraph contain an Euler path or circuit? 11. Does the following graph contain an Euler path or circuit? 12. Based on the answers to your previous two questions, form a conjecture on the existence of Euler paths in partially directed multigraphs based on the degrees of vertices and direction of edges. 13. Write an algorithm which, given the adjacency matrix A of a simple graph G (i.e., not a multigraph), computes whether the graph contains 6