Consider the following (true) theorem: If G is a Eulerian planar graph where every face is a triangle, then the vertices of G can be coloured red, white, and blue, so no two adjacent vertices are given the same colour. (a) What is the dual statement of the above theorem. (b) Provide two graphs, one that satisfies the conditions of the first statement, and one that satisfies the conditions of the dual statement