Given the set S = {32, 34, 31, 12, 7, 10, 27, 30, 6, 19, 2, 17} and target T = 50:

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.
