please solve using C++

Find all sequences of integers (0 through 11) that add up to a given integer n. Method: You MUST use the dumb 8 queens approach. (35) Part 1: In class we saw that the solution to many computational problems may be framed as 0 building sequences (which we saved in an array q) 0 using elements from a set 5 (positive integers) o and passing the array q to an \"OK function\" a, Say that you are given a specic Value of n how big should the array q be? Explain why. (5 points) b. What should the values of the set s be for a given value of n? Explain why. (5) c. What should the OK function check for? Explain why. (5) Part 2: Assume n=5. Describe in detail how you can solve the problem above using the \"dumb 8 queens\" approach. (5) Part 3: Write the program for n=5. (15) Important: Your solution should print the values in ascending order with no duplicates. Also, do not output any zeros. For example, your program should print 1,4 and not 4,1