Graph Coloring · Challenge problem

Five countries $A,B,C,D,E$ are drawn on a map so that $A,B,C,D$ all mutually share a border with each other, and $E$ shares a border only with $A$. What is the minimum number of colors needed so that every pair of bordering countries gets different colors?