i solve problem1, but i need help for solving problem2.

Problem 2 Shortest Path Algorithm ShorestPath.java: In this part, you will implement the algorithm to find the shortest path in a graph. This class must only have a single method that expects a Graph object, a starting node (Integer), and an end node (Integer) as arguments. The function returns the total weight of the shortest path found between these two nodes. Hints: Review the lecture regarding shortest path algorithm. It requires a HashMapInteger, Integer to keep track of computed distances between starting node and every other node (key is node, value is cost) Use for (Entrysinteger, ?nteger2 row: map. entrySet())to find the node (row.getKey) with the lowest cost (row.getValue)) It requires a HashSetkInteger to keep track of visited nodes