Image Region Flood Fill

Image segmentation often begins by identifying spatially contiguous regions of similar features or colors. The Flood Fill algorithm is a classic graph traversal technique (typically implemented via Depth-First Search or Breadth-First Search) used to select and modify such a connected area starting from a specific point.

You are given a 2D integer array image representing a digital image. Each integer represents a pixel value (intensity). Given a starting pixel at coordinates (sr, sc) and a newColor, perform a "flood fill" on the image.

The flood fill operation should target the starting pixel, plus any pixels connected 4-directionally (horizontal or vertical) to the starting pixel that share the original color, and so on recursively. All targeted pixels must have their color replaced with newColor. You must return the modified image array.

Constraints:

• The length of image and image[i] will be in the range $[1, 50]$.
• The given starting pixel will satisfy $0 \leq sr < \text{image.length}$ and $0 \leq sc < \text{image[0].length}$.
• The value of each color in image[i][j] and newColor will be an integer in $[0, 65535]$.
• If the original color is the same as the newColor, no action should be taken to prevent infinite recursion/loops.