Knights Path Given a chess board of n rows (top to bottom) andn columns (left to right). In each move, a knight moves either:• 2 column positions and 1 row position 2 row positions and 1 column positionIn other words, a move is 2 steps along one axis and 1 step along a perpendicular axis. A bishop, on the other hand, moves any number ofsteps diagonally. Both the knight and bishop capture any piece thatis on a position that it moves to. A position that apiece can move to is said to be threatened by thatpiece, because if another piece moves to thatposition, then it can be captured. Given a starting position A and ending position Bfor the knight, and a bishop position C, calculatethe minimum number of moves needed by theknight to move from A to B while avoiding allpositions threatened by the bishop. If the knightcaptures the bishop on one of its moves, then itcan move into positions that were previouslythreatened by the bishop. If there is no possiblepath to B, return-1. All moves must remain withinthe chess board. The knight may move to B even ifB is threatened by the bishop.