Given the set S = {18, 16, 11, 4, 12, 7, 13, 15, 29, 17, 6, 14} and target T = 41:

Find all subsets of S that sum to exactly T. Use a backtracking algorithm that explores the full search tree. For each solution found, emit the subset and verify its sum. Report the total number of solutions.
