We can define the distance between two locations, loc1 and loc2, as the length of the shortest path from loc1 to loc2, in which consecutive locations are neighbors. (a location has eight neighbors, so diagonal steps are allowed. the distance from a location to itself is 0 and to any adjacent location is 1.) devise a formula that computes this distance. write and test a class with one static int method distance(location loc1, location loc2) that returns the distance between loc1 and loc2.