Graph Coloring · Easy problem

A planar network has four mutually linked hubs $1,2,3,4$ (every pair of hubs is directly linked), plus one extra device $5$ linked ONLY to hub $1$. Two linked devices must get different colors. What is the fewest colors needed for all five devices?