You are given an image represented by an `m x n` grid of integers. You are also given a starting pixel `(sr, sc)` and a new `color`.
Perform a flood fill: starting from `(sr, sc)`, change the color of that pixel and every 4-directionally connected pixel of the **same original color** to `color`. Return the modified image.
Example 1
Input:image = [[1,1,1],[1,1,0],[1,0,1]], sr = 1, sc = 1, color = 2
Output:[[2,2,2],[2,2,0],[2,0,1]]
Explanation:All 1s connected to the center become 2.
Constraints
- m == image.length
- n == image[i].length
- 1 <= m, n <= 50
- 0 <= image[i][j], color < 2^16