please solve using c++ and the Backtracking Recursion method
must use the starter code(link) down below
Given a positive integer n, write a function that finds all ways of writing n as a sum of nonzero
natural numbers. For example, given n = 3, you’d list off these options (how these 4 terms ordering
does not matter):
3 : 1 + 2; 2 + 1; 1 + 1 + 1
In particular, your task is to finish the following function in the starter code
void printSumsRec(int n, vector &soFar) {
// TO DO... Your codes below
}