﻿Given the set S = {3, 34, 7, 12, 5, 26, 11, 8, 15, 2, 19, 21} 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.
