Sections $5\mathrm{.}1$ and $5\mathrm{.}2$

Show the first two solutions to the $n-$Queens problem for $n=6$ and $n=7($two

solutions for each$)$ using the Backtracking algorithm. foundations of algorithms $5$th section $5$