Coloring ($P_5$, bull)-free graphs

We give a polynomial-time algorithm that computes the chromatic number of any graph that contains no path on five vertices and no bull as an induced subgraph (where the bull is the graph with five vertices $a,b,c,d,e$ and edges $ab,bc,cd,be,ce$).