Write a program that implements the A* algorithm to find a pathfrom any two given nodes. In a fully-observable environment wherethere are both navigable (not blocked) and blocked nodes, an agentmust find a good path from their starting node to the goal node.Your implementation must meet the following requirements.
1. The code must be written in Java 1.8 3.
2. You must write this program from scratch.
3. The agent must use the A* algorithm to determine its path.For this program, you must use the Manhattan distance method forcalculating the heuristic.
4. No graphics are required for this program but using them willhelp you
OR
OR