Many 3-colorings of triangle-free planar graphs

Grötzsch proved that every planar triangle-free graph is 3-colorable. We prove that it has at least distinct 3-colorings where n is the number of vertices. If the graph has girth at least 5, then it has at least distinct list-colorings provided every vertex has at least three available colors.