Write Java program that implements the A* algorithm to find a path from any two given nodes.

Problem Overview & Algorithm Description

The agent must find a good path from their starting node to the goal node.

The agent must use the A* algorithm to determine its path.

For this program, you must use the Manhattan method for calculating the heuristic. Your environment should be a 15x15 tile-based world that randomly generates nodes that are unpathable (blocks) in

This should be done each time the program compiles ensuring that there are different environment makeups each run. 10% of the nodes

The program should display the generated environment when the program runs

The Program should allow the user to select a starting node and goal node

Once the start and goal nodes have been defined, the program should run the A* algorithm to find a path

In a fully-observable environment where there are both pathable and blocked nodes,

The path should be displayed (series of [x,y] nodes, highlighting nodes, or actually moving the agent) if one exists, or a message indicating that a path could not be found.

The user should be able to continue specifying starting and goal nodes after paths have been found.