Create a constant array of Legs with at least 40 Leg objects. The Leg array you made for the previous Routes versions will probably have to be modified because of the requirements below. Store the Leg array as a static data member of the ShortestRoute class. The Legs must represent a network of interconnecting cities, between San Francisco and New York City. Use a map of the United States to get the names of intermediate cities of your choice, and the distance between them. Distances do not have to be exact, but they do have to be reasonably close, so that the results generated by your program can be verified.