Can somebody assisit me on 2.10? An equation i found that worksis N = 8t but i’m unsure on the best way to write thise. basicallyany number from 1,2,3,4 etc that is plugged in for t would

work.

.

Exercise 2.9. Complete the solution (proposed in Section 2.3.1) to the n- queens problem by giving a solution for values ofn that leave a reminder of 2 or 3 when divided by 6. (Hint: Solve for n = 8 and try to generalize.) Exercise 2.10. There are n coins placed in a row (see Figure 2.0 for an example). The goal is to form n/2 pairs of them by a sequence of moves. On each move a single coin can jump left or right over two coins adjacent to it (either over two single coins or one previously formed pair) to land on the next single coin — no triples are allowed. Note that the coin cannot land on an empty space (it has to land on exactly one coin). Empty space between adjacent coins is ignored. Find out all values of n for which the puzzle has a solution and devise an algorithm (enough to explain your algorithm in English) that solves the puzzle in the minimum number of moves for such n. Explain why your solution works in the minimum number of moves. (Hint: Clearly, there is no solution when n is odd. Find the smallestn for which there is a solution. For largern use a decrease and conquer strategy). 000 000 5 e a S. 6 8 9 e 1 wl S a D a x 2:31 AM 2/8/2018 Show transcribed image text Exercise 2.9. Complete the solution (proposed in Section 2.3.1) to the n- queens problem by giving a solution for values ofn that leave a reminder of 2 or 3 when divided by 6. (Hint: Solve for n = 8 and try to generalize.) Exercise 2.10. There are n coins placed in a row (see Figure 2.0 for an example). The goal is to form n/2 pairs of them by a sequence of moves. On each move a single coin can jump left or right over two coins adjacent to it (either over two single coins or one previously formed pair) to land on the next single coin — no triples are allowed. Note that the coin cannot land on an empty space (it has to land on exactly one coin). Empty space between adjacent coins is ignored. Find out all values of n for which the puzzle has a solution and devise an algorithm (enough to explain your algorithm in English) that solves the puzzle in the minimum number of moves for such n. Explain why your solution works in the minimum number of moves. (Hint: Clearly, there is no solution when n is odd. Find the smallestn for which there is a solution. For largern use a decrease and conquer strategy). 000 000 5 e a S. 6 8 9 e 1 wl S a D a x 2:31 AM 2/8/2018