In Java-

You are given a list of cities in alphabetical order and a list of pairs of cities having a direct railroad connection between them. Write a program named Connected that:

Builds a union-find object from the two data files. Because you cannot store strings in a union-find object, create an array of strings for the cities and use a city's index in that array to represent it in the UF object.

Reads in a third file where each line contains a pair of cities and prints each of these pairs and whether they are connected by rail.