Circuits of length 5 in 2-factors of cubic graphs

For every even integer n≥28n≥28 we construct a cyclically 4-edge-connected snark of order nn which has girth 5 and contains a 5-circuit in every 2-factor. In addition, for every given positive integer kk, we construct a nontrivial snark having at least kk 5-circuits in every 2-factor.