Write a binary search method (in a class called BinarySearch) that searches for a city by name and returns the City object if found. Create a sample try with two cities from each Canadian province. A file, City.java, is given to help:

public class City implements Comparable { private static String [] PROVINCE_CODE = {"BC", "AB", "SK", "MB", "ON", "QC", "NB", "NS", "PE", "NL", "YT", "NT", "NU"}; private String name; private int population; private String province;

public City (String name, String province, int population) { setName(name); setProvince(province); setPopulation(population); }

public String getName() { return name; } public void setName(String name) { this.name = name; } public int getPopulation() { return population; } public void setPopulation(int population) { if (population < 0) { this.population = 0; } else { this.population = population; } } public String getProvince() { return province; } public void setProvince(String province) { this.province = province; }

public String toString() { return (this.name + ", " + this.province); }

@Override public int compareTo(City otherCity) { return (this.toString().compareTo(otherCity.toString())); }

}