Please finish the given c$++$ code$$

#include

using namespace std;

const int MAX$\_$NUM$\_$TOWER $=4$;

const int MAX$\_$NUM$\_$FLOOR $=4$;

const int MAX$\_$ENCOUNTER$\_$LENGTH $=10$;

$//$ Helper function to copy values an array to another. Provided.

void copy$\_$floor$($int to$[],$ const int from$[])\{$

$$ for $($int i$=0$; i highest$\_$strength$)\{$

$$ highest$\_$strength $=$ recursion$\_$result;

$$ copy$\_$floor$($best$\_$floor$\_$path, recursion$\_$floor$\_$path$)$;

$\}$

$\}$

$//$ If the current tower is fully explored, backtrack the best path for the current floor and call the recursive function for the next tower

$$ if $($explored$\_$floor$\_$count $==0)\{$

$//$ TODO: Backtrack the best path for the current tower using a line of code $($Use copy$\_$floor$())$

$//$ End of TODO

$$ int floor$\_$explored$[$MAX$\_$NUM$\_$FLOOR$]$;

$$ int floor$\_$path$[$MAX$\_$NUM$\_$FLOOR$]$;

$//$ TODO: Complete the recursive function call to move to the next tower

$$ find$\_$path$()$;

$//$ End of TODO

$\}$

$//$ TODO: Backtrack the best path for the current floor selection using a line of code $($Use copy$\_$floor$())$

$$

$//$ End of TODO

$$ return highest$\_$strength;

$\}$