Warehouse Robot Path

A warehouse robot needs to move inventory from a starting point to a destination in a grid while avoiding obstacles and accounting for slow zones. The grid is represented as a 2D list where:

• 0 represents an empty cell with a movement cost of 1.
• 1 represents an obstacle that the robot cannot traverse.
• 2 represents a slow zone cell with a movement cost of 2.

The robot can move in four directions: up, down, left, or right, but cannot move diagonally.

Task:

Write a function that takes in the grid and two tuples representing the starting and ending coordinates (row, column) and returns the minimum total cost required for the robot to reach the destination. If no path exists, return -1.

Example:

Input:
  grid = [
    [0, 0, 0],
    [0, 1, 2],
    [0, 0, 0]
  ]
  start = (0, 0)
  end = (2, 2)

Expected Output: 
  The minimum cost from (0, 0) to (2, 2).

Constraints:

• The grid size will be between 3x3 and 50x50.
• The start and end positions will always be valid (and not an obstacle).

Design an efficient solution to compute the minimum cost path considering the movement costs associated with slow zones.