R2-D2 navigates the grid thanks to you but is now facing a more hostile grid, one with obstacles represented by 1s. Use the same assumptions provided in Q1 and return the length of the shortest path avoiding obstacles. Return -1 if no such path exists.

Hints: 1. Dont explore neighbors that dont exist (are beyond the grids boundary) 2. Dont explore neighbors that are obstacles. 3. Your search ends when there is nothing to explore.

grid = [[0,0,0], [1,1,0], [1,1,0]] start, goal = (0,1), (2,2) Solution = 4 grid = [[0,1], [1,01] start, goal = (0,0), (1,1) Solution = -1 ---> The R2-D2 can't travel diagonally and thus there doesn't exist any feasible path