2. a) (5 pts.) Using the following grid, demonstrate how the A* algorithm would work to reach the goal state from the start state: b) (5 pts.) Solve the cryptarithmetic problem below using constraint satisfaction techniques (show your graph): COW * COW = DEDCOW