Answer the following statements true (T) or false (F)

1) A breadth-first traversal uses a stack as a supporting data structure.
2) An adjacency matrix is one approach to implementing a graph that uses a two-dimensional array.
3) A spanning tree of a graph does not necessarily include all of the edges of the graph.
4) A cycle is a path that starts and ends on the same vertex.
5) minimum spanning tree of a weighted graph is a spanning tree in which the sum of the weights of the edges is less than
or equal to the sum of the weights for any other spanning tree for the same graph.

1) F
2) T
3) T
4) F
5) T