Using java can someone help me create a program using the following instructions.

Input file:

10 A J 18 A H 79 A I 81 J G 24 J F 76 G F 2 G H 50 F E 4 E D 2 D H 20 H C 50 I D 6 I C 97 I J 27 C B 22

Solution File:

142 A J G F E D H C B

4. (70 points) Implement Dijkstra's algorithm for computing a shortest path from a designated vertex (A) to a designated vertex (B) in a directed graph. Your implementation should use a minimum heap as a supporting data structure. Please follow the instructions below