Solve using java only...

Kindly provide correct solution

Objective

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:

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 City$100).$

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 method MaxCities$($cities$,$distances$)$which returns the maximum number of cities that Jeff can visit.

The first input argument, cities, is an array of strings representing the city names. For example:

$[\text{'}$Tucson$\text{'},\text{'}$Albany$\text{'},$ 'Smith', 'Westford', 'Berkeley'$]$

The second input argument, distances, is an array of integers representing the distances from the West point to the cities. Each distance is unique and between $1$and $9,999($inclusive$).$The first distance in distances corresponds to the first city in cities and so on$.$For example:

$[102,95,114,1421,50]$

Your MaxCities method should return an integer, which represents the maximum number of cities that Jeff can visit.

For the above example, the correct output would be $3.$In this case, Jeff is able to visit Berkeley then Tucson then Westford while still following his two rules.