Java Program

In Computer Science, the Manhattan-Distance between two squares is determined by the minimal number of orthogonal King moves between the squares on the empty board. For example in Figure 1, the distance between the king and the queen is 9. Figure 1: Manhattan-Distance between two chess pieces Write a java program that gets the locations (a,0) and (3 ) of a king and another chess piece and determines all the paths from the king to the chess piece with the same Manhattan-Distance