Write a C program and get the expected result

Implement a C program applying backtracking strategy to find a subset of a given set S={S, S2,,Sn \} of n positive integers whose SUM is equal to a given positive integer d. At most two solutions can be printed. For example, if S={1,2,3,4,6} and d=8, there are two solutions {0,1,0,0,1} and {1,0,1,1,0}. For example if S={1,3,4,7} and d=6, the output should be 'Solution cannot be found'. Note : Read number of elements in the set, the elements and the expected sum from the user. Print at most two solutions. For example