Path finding Search C++

Hint: vector> grid

(row, vector(col, 0))

Each grid cell can be referred to by its row and column coordinates. Below is an 8 by 8 grid Row 0 Row 1 Row 2 Column 0 Column 2 Column 1 One grid cell is marked as the initial location (in blue), and another cell is marked as the goal location (in red). In this example, the starting location is (7,3) and the goal location is (2,6) Only four actions are allowed in this problem: move left by 1, move right by 1, move up by 1, and move down by 1. No diagonal movements are allowed You Al program should find a solution, which is a sequence of grid locations that leads the turtle from the start to the goal location. With the example above, one possible solution would be (7,3) (7,4) (7,5) (7,6) (6,6) (5,6) (4,6) (3,6) (2,6) Part 1: Create a new Project-> Visual C++ -> Empty Project. Add a new C++ source file #include iostream using nanespace std; int main() // add your code here cerr