Implement the Uniform Cost Search Method in JAVA using the algorithm given below. Use the traveling salesperson example as the domain for the search problem.

The program requirements are as follows:

Input: Start State, Intermediate States, Goal Test, Path Cost.

Processing: The search method goes from the start state to the goal state.

Output: Path(s) traced from start state to goal state by the program, Total path cost calculated by the program, and a physically drawn out Search Tree.

*Note: It is not required to develop a GUI in the program to show the state map or the paths traced. It is sufficient to show the paths by listing the states from start to goal as a program output.*

12 2 3 12 2 3