Has to be in java and must compile

The purpose of this assignment is to be able to utilize a data structure to solve a particular problem. In this assignment you are asked to create a data structures that can store a graph, then use this to be able to find the shortest path between two nodes in a graph You are to write a java program hw3.java that allows a user to load a graph written on a text file (see example below). The program should utilize an applicable data structure to: Load the graph on memory. Your first requirement is to load the graph from a text file. Your second requirement is to print the graph by accessing the data structure. The third requirement is to make the user provide a source node and a destination node, the console should print the value of the shortest path from the source node to the destination node Extra credit: For the third requirement, print the value of the shortest path as well as the path itself -the series of nodes from source node to destination. (+ 50 %) 1 2. 3. 4. A Graph A graph is a set of nodes and edges. Each node has a label 0, , 2 and so on, An edge is defined by three parameters: (1) a source node, a label, (2) a destination node, another label, and (3) a weight, which isa integer that represents the distance between the source node and the destination node. The figure shown below is an example of a graph. 2 V3 Vs In this graph, nodes are labeled 0, 1, 2.. 6. An example of an edge (0, 1, 3), which is the edge that joins nodes 0 and 1, and having a weight of 3. You are given a text file graphl txt which has the format nodel, node2, and weight, all tab delimited graphl.txt) and so on) The purpose of this assignment is to be able to utilize a data structure to solve a particular problem. In this assignment you are asked to create a data structures that can store a graph, then use this to be able to find the shortest path between two nodes in a graph You are to write a java program hw3.java that allows a user to load a graph written on a text file (see example below). The program should utilize an applicable data structure to: Load the graph on memory. Your first requirement is to load the graph from a text file. Your second requirement is to print the graph by accessing the data structure. The third requirement is to make the user provide a source node and a destination node, the console should print the value of the shortest path from the source node to the destination node Extra credit: For the third requirement, print the value of the shortest path as well as the path itself -the series of nodes from source node to destination. (+ 50 %) 1 2. 3. 4. A Graph A graph is a set of nodes and edges. Each node has a label 0, , 2 and so on, An edge is defined by three parameters: (1) a source node, a label, (2) a destination node, another label, and (3) a weight, which isa integer that represents the distance between the source node and the destination node. The figure shown below is an example of a graph. 2 V3 Vs In this graph, nodes are labeled 0, 1, 2.. 6. An example of an edge (0, 1, 3), which is the edge that joins nodes 0 and 1, and having a weight of 3. You are given a text file graphl txt which has the format nodel, node2, and weight, all tab delimited graphl.txt) and so on)