Class Activity 4: Implementing UCS, Greedy, and A*

Implement the following in the code base:

• UCS
• Greedy
• A*

Have me take a look at your implementations (there's no code to submit).

For the maze problem, compare using the manhattan and euclidean heuristics on different mazes. Does one outperform the other? In what situations do you think one would outshine the other and vice versa? Submit your analysis in the text box in the submission area.