Let G be a connected planar graph with n vertices and m edges, and let f be the number of regions in any plane diagram of G. Then f + n = m + 2 holds. This is called Euler’s theorem on planar graphs. Now for n=3 and m=6 we have f=6-3+2=5, which is the number of regions. Thus the correct answer is C.