Java help please

Examine the following image (GeeksforGeeks, n.d.): i 20 10 15 30 25 35 2 3 Solve the traveling salesman problem (TSP) based on the given image using dynamic programming. The TSP ensures that every node is visited exactly once with the minimum weight. Solve this problem using the following steps: 1. Implement a graph with all of the vertices and weights. 2. Create a node structure; each node should have the same value based on to the above. 3. Use dynamic programming to solve the TSP. 4. Print all of the node values based on the output from dynamic programming Build the graph: The graph should contain all of the vertices and edges that connect them. . TSP: The TSP method should be created using dynamic programming. The output of this method shows all of the nodes that are visited