a) Prove that from a connected graph, several edges can be removed so that a tree remains.
b) Prove that in a tree with vertices, there are exactly edges.
c) Prove that in a tree, there are at least two leaf vertices.
d) Prove that in a connected graph with vertices, there are at least edges.
e) Prove that if a connected graph has vertices and edges, then it is a tree.