Let $G$ be a connected graph with chromatic number $\chi(G) = 4$. If we identify a bridge (cut-edge) in $G$ and remove it, what is the minimum possible chromatic number of the resulting graph?