Print all combinations of numbers from 1 to n that sum to n.

To find all combinations of numbers from 1 to n that sum up to n, you can use a recursive approach. The core idea is to explore possibilities by either including the current number in the combination or skipping it.

Algorithm:

1. Base Case: If the target sum n becomes 0, it means a valid combination has been found. Print the current combination.
2. Recursive Step: For each number i from 1 up to n:
   • Include i: Add i to the current combination and recursively call the function with the remaining sum (n - i) and the next number to consider (to avoid duplicates, start from i).
   • Backtrack: After the recursive call returns, remove i from the current combination to explore other possibilities.

This method systematically generates all unique combinations that satisfy the sum requirement.