Label each statement true or false

1)The symbol can be read as for all and is used in universal statements.

2)For a function to be invertible, it must be both one-to-one and onto.

3)Using the same variable name to mean two different things is a common mistake in proofs.

4)For any set S, let |S| be the number of elements in set S. For any finite sets A and B, |A u B| = |A|+|B|-|A n B|

5)Dijkstras Algorithm produces a minimum spanning tree.