Graph Coloring · Medium problem

For the complete bipartite graph $K_{3,3}$ (two groups of $3$, every cross pair linked, no links within a group), by how much does the greedy-coloring bound $\Delta(G)+1$ exceed the TRUE chromatic number?