Given the set S = {34, 16, 24, 6, 2, 18, 5, 35, 27, 30, 13, 11} and target T = 40:

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.
