this is test code

please use python to solve.

Exercise 9: Knight's Challenge Complete the function knight' that takes three parameters: an initial posi- tion, a final position, and a number of moves. The function returns True if a knight on an empty chessboard can get to the final position from the start- ing position in at most the given number of moves; otherwise, the function returns False. Useful facts: A chessboard is an 8x8 square board. Each cell of the chessboard is identified by its coordinates: a letter from 'a' to 'h' that identifies the column, and a number from 1 to 8 that identifies the row. The positions are provided to the functions using this format. The chessboard contains only the knight, which is located at the spec- ified initial position. A knight may move two squares vertically and one square horizontally, or two squares horizontally and one square vertically. Examples: knight('al', 'c5', 2) H True. knight('c2', '23', 3) H True. knight('co', 'h1', 1) False. Hint: You may want to use recursion. def test_knight(): assert knight("a1", "c5", 2) == == True assert knight("c2", "e3", 3) == True assert knight("C6", "h1", 3) == False