Dynamic Maze Navigator

You are given a dynamic maze represented as a 2D grid. Each cell in the grid contains one of the following characters:

• .: an open cell that can always be traversed.
• #: a permanent wall that can never be traversed.
• *: a dynamic obstacle cell that alternates between being open and blocked. Specifically, at even time steps (starting from time t = 0) these cells are open (i.e., act as .), and at odd time steps they are blocked (i.e., act as #).

You are also given the starting coordinates (x0, y0) and ending coordinates (x1, y1) (assume 0-indexed row and column).

At each time step, you can move to an adjacent cell (up, down, left, or right) or choose to wait in place. Each move (or a wait) takes exactly one time step. The status of the dynamic obstacle cells (*) is updated at the beginning of each time step according to their toggle rules described above.

Write a program that calculates the minimum number of time steps required to travel from the start to the end coordinate. If it is impossible to reach the destination, return -1.

Your solution should process the grid and account for the toggling behavior of the dynamic obstacles while planning the path.

Assume that the maze, start, and end positions are provided as input in a suitable format, and design your code accordingly.