For the following digraph:

(2 pts) List the vertices.

(2 pts) List the edges.

(2 pts) Does this graph contain any cycles?

(2 pts) Show the adjacency matrix.

(2 pts) Show the adjacency list.

Starting at vertex 0, list the vertices in the graph in the order they would be visited during a:

(2 pts) Breadth-first traversal.

(2 pts) Depth-first traversal.

(2 pts) Starting at vertex 0, show the breadth-first search tree subgraph.

(2 pts) Starting at vertex 0, show the depth-first search tree subgraph.

7 2 4 1 6 3 5