2812. Find the Safest Path in a Grid

A square n×n grid where 1 = a thief's cell, 0 = empty. Start at the top-left (0,0) and reach the bottom-right (n−1, n−1), moving between 4-directional neighbors. A path's safeness factor is the…