What is the adjacency matrix for the graph?

For the graph, give example of a topological sorting, then remove edges (1, 5) and (2, 3) from the same graph and give another example of topological sorting.

In order to cover the graph, the breadth-first search algorithm was used. The starting vertex is 1. What is the traversal order determined by the breadth-first search algorithm?

In order to cover the graph, the depth-first search algorithm was used. The starting vertex is 2. What is the traversal order determined by the depth-first search algorithm?

What edges are parth of the minimum spanning tree (the direction of the edges is ignored)? What will be the total cost of the tree?

1 11 Figure 1