In a chess game, a knight can move two squares vertically and one square horizontally, or two squares horizontally and one square vertically. In this problem, you need to find the smallest number of moves the knight needs to take to reach the star $1*\text{'}$ in the board. This is a brute force problem where you need to attempt and track different paths of the knight. For example, for the given position of the knight at $(0,0)$ and the star position at $(5,6),$ the smallest number of required moves is $5.$ The required moves are tracked as follows: If the star position cannot be reached, the program should print a$-1.$This rule applies also in case the starting or the last position is out of bound of the board. Input Format Sample input: $0056$ Sample input explanation: the inputs are the row and column locations of the knight and the final position respectively. Constraints $**$ For this contest, you will be given a week to attempt solving the problem. Use it wisely!!! Output Format Sample output explanation: The knight needs to make $5$ steps to reach the star position. DO NOT USE Al$-$based code generation tools. We can detect it and you will receive zero. In best case, you will asked for a face$-$to$-$face interview. It might be easier to write a recursion to solve the problem. Slovrolve it with C language code