graph theory proof

Apr 2010
hey everyone, any help with this one would be great. i missed a few classes while my lecturer was going through matching so im a bit unsure.

Let M be a matching in a graph G, and let S be the set of vertices matched by M. Prove that there exists a maximum matching in G under which all vertices in S are matched.

thanks heaps.