Computer science questions (C++): Implement the 5 following functions into the program given

knight.cpp

main.cpp

getNextLocation -fix infinite loop. If no squares available, set row and col to -1 2. 1. testAll-run knights Tour many times, and report best result 3. calcAccess-implement. How many squares can the knight reach in 1 move? 4. knightsTourWarnsdorf-implement. Uses Warnsdorf's heuristic 5. knightsTourWarnsdorfRecalc- implement. Recalculate 'Access' after each move Submit your version of main.cpp and knight.cpp, extended to solve as many of the problems 1 thru 5 as you can manage. At minimum, attempt 1, 2 and 3. Submit printout from a run of testAll #include using namespace std; const int BSIZE 8; void printBoardLine) for (int = 0; using namespace std; // forward declarations int knightsTour (i // should try out knightsTour multiple times and report best result void testAll) int result knightsTour cout