Painted octahedron

What is the smallest number of colours needed to paint the faces of a regular octahedron so that no adjacent faces are the same colour?
Exploring and noticing Working systematically Conjecturing and generalising Visualising and representing Reasoning, convincing and proving
Being curious Being resourceful Being resilient Being collaborative

Problem

Image
Painted Octahedron
 

The faces of a regular octahedron are to be painted so that no two faces which have an edge in common are painted in the same colour.

What is the smallest number of colours required?

If you liked this problem, here is an NRICH task that challenges you to use similar mathematical ideas.