Given the information below, construct a simple graph showing the vertices and edges.
1. Vertex A is connected to B and C, but not to E.
2. Vertex B is connected to A and D, but not G
3. Vertex E is connected to every other vertex except A and C.
4. Vertex G is connected to E, and F
5. Vertex D is connected to every other vertex except A and G.
6. Vertex C is connected to A, D, and F.