Small Java Assignment

Requirements: -> The program must accept a single argument, a path to the input file. e.g. "~/[login to view URL]” The input file will be structured as follows: -> The first line will be the graph definition, a single line of routes separated by spaces. -> A route will be defined as AC5 (i.e. The distance from A to C is 5). Following the problem definition each line will represent one of the following questions (The routes included in these questions are examples only). DISTANCE CBAE What is calculated distance of the route CBAE? The answer should be the route, including distance. i.e. CBAE12 SHORTEST CA What is the shortest route from C to A? The answer should be the route, including distance. i.e. CBA12 POSSIBLE CA15 What are the possible routes from C to A with a maximum distance of 15? The answer should be all routes, including distances, separated by spaces. i.e. CBA8 CBADA12 CBDA11 CBDADA15 CEA12 CBEA15 The input file can contain any number of questions, in any order. Output: Output the answers to a file named '[login to view URL]', one answer per line, in the following format: DISTANCE CBAE = CBAE12-