Grid Color Evolution

You are given a 2-D grid of size m x n where each cell is initially either 0 (white) or 1 (black). In one step every white cell that has at least one black neighbor (up, down, left, or right) becomes black. Black cells never revert to white. Return the minimum number of steps required for the entire grid to become black, or -1 if it is impossible.