A knight starts on any square1 on the chessboard. Write function knight(square1, square2) that returns one of the shortest paths for the knight to move from square1 to square2. For example, knight('d5', 'e6') should return either ['c7', 'e6'] or ['f4', 'e6']. If square1 is the same as square2, return []. Upload your code on GitHub and paste the link down below.