CODE LANGUAGE (IF USED) : PYTHON

(3) Consider the following problem. Given a positive number N, find all combinations of 2N elements with the following conditions: Every element from 1 to N appears exactly twice. The distance between the same element is exactly the value of the element. For example: Input: N = 3 Output: dist=3 dist=2 dist=1 3 1 2 1 3 2 2 3 1 3 2 1 dist=3 dist=2 dist=1 More examples: Input: N = 4 Output 41312432 2 3 4 2 1 314 Input: N = 7 Output: 1712 56 2 3 4 75364 517162 5 4 2 3 7643 41716 4 2 5 3 2 7635 + Total 52 possible combinations. (i) Demonstrate your idea to solve this problem by Backtracking. (7 marks)