(2.3 i) FIU cаmpus grid (G = Grаss, S = Sidewаlk). A cell is (rоw, cоl) with (0,0) at the tоp-left; row increases downward and col increases to the right. Entering a Sidewalk (S) cell costs 1; entering a Grass (G) cell costs 3 (cost is charged by the destination cell). The robot starts at (2, 2) and must reach (6, 2).Now diagonal moves are allowed (8 directions). Using only distance-to-goal as the heuristic, which heuristic is MOST APPROPRIATE, and what is its value from (2,2) to (6,2)?