Given the set S = {13, 26, 9, 6, 28, 11, 16, 3, 23, 5, 24, 2} and target T = 38:

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.
