1.In the aggregate analysis different operations may have different amortized costs,while in the accounting method all operations have the same amortized cost.

2.BFS finds the shortest distance to a node from the starting point in unweighted graphs.

3).Given a graph G. If the edge e is not part of any MST of G, then it must be the maximum weight edge on some cycle in G.

4).Assume that no two men have the same highest-ranking woman. If the women carried out the proposal to men, then the Gale-Shapley algorithm will contain a matching set where every man gets their highest-ranking woman.

5).If a path P is the shortest path from u to v and w is a node on the path, then the part of the path from u to w is also the shortest path from u to w.

T/F