HackerMan Maze Navigation

Problem Statement

HackerMan Maze Navigation Problem Description In a grid-based maze, each cell is either empty (0) or contains an obstacle (1). HackerMan must navigate from cell (0, 0) to cell (n-1, m-1) with a jump parameter k, allowing these moves: Right: (i, j) → (i, j+x) where 1 ≤ x ≤ k Down: (i, j) → (i+x, j) where 1 ≤ x ≤ k Left: (i, j) → (i, j-x) where 1 ≤ x ≤ k Up: (i, j) → (i-x, j) where 1 ≤ x ≤ k For any move, all cells in the path must be obstacle-free and within maze boundaries. Determine the minimum number of moves required to reach the destination, or return -1 if it is impossible. Function Description Complete the function getMinimunMoves in the editor with the following parameters: int maze[n][m] : the maze where HackerMan is standing int k : the maximum distance HackerMan can traverse in one move Returns: int the minimum number of moves in which HackerMan can reach the destination cell (n-1, m-1) Examples Example 1: Consider n=2, m=2, jump pa