Given the set S = {12, 8, 11, 26, 29, 17, 4, 6, 3, 21, 33, 13} and target T = 43:

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.
