write a program $($named knightsTour$)$ to find solutions for the Knights Tour using brute force $($just trying all possible solutions$).$The program should use a $5$x$5$ board $($the size should be easily reconfigurable with a single constant change$)$start with the knight in the middlePrint out all solutions, and the total # of solutions foundNote: this program does not require a class be defined or objects created.Sample OutputIt should show all the solutions, followed by a count of how many solutions there were. A sample run $($if wed started in the lower left corner, which were not doing, were starting in the middle $($i$.$e$.3,3)$ would look something like this:Welcome to the Knights Tour solver!Board size: $5$Starting position $($row$,$ col$)$: $5,1$ Thinking....Solution #$1$:$23101914251805240920112213041506170221080112071603$Total Solutions: $304$You MUST use the solveKnightsTour$()$ function as defined in this section $($or something very similar$).$Each instance of the recursive function call needs its own copy of the board$-$to$-$date. Since arrays are always passed by reference, and we need to pass by value $($to get our own copy$),$ the simplest solution is to define the board array inside a struct or class because classes and structs can be passed by value $($and are by default$).$When complete, print out which boards, if any, are also a semi$-$magical squares $($the sum of each column and each row is the same$).$ Write code In C$++$