Need solution in c++ In this problem, you need to find the maximum number of cities that Jeff can visit on his way from West to East. As Jeff travels from West to East, he has two rules: 1. He can only travel to cities in lexicographic order (e.g. Jeff cannot travel from Berkeley to Albany nor can he travel from City 2 to City100). 2. He can only travel to cities that are further from the West than the city he is currently at (e.g. if Jeff is at Berkeley, he cannot travel to cities that are closer to the West than Berkeley). Implementation Implement the function max_cities(cities, distances) which returns the.