Click here to read the complete problem statement.
Can anyone give me hints for this question
We divide the path into eight “
” movements and eight “
” movements. Five sections of alternative 
or 
are necessary in order to make four “turns.” We use the first case and multiply by 
.
For , we have seven ordered pairs of positive integers 
such that 
.
For , we subtract 
from each section (to make the minimum stars of each section …
1 Like