Python programming language required

Standard input will contain an integer N on a single line. Write out all possible ways to form N as a sum of positive integers. Each sum must be on a separate line, with the integers in non-decreasing order and separated by a't' character. The ordering of output lines does not matter. Sample input: 5 Possible output:_ 1+1+1+1+1 1+1+1+2 1+1+3 1+2+2 1+4 2+3 5 Sample input #2: 7 Possible output: 1+1+1+1+1+1+1 1+1+1+1+1+2 1+1+1+1+3 1+1+1+2+2 1+1+1+4 1+1+2+3 1+1+5 1+2+2+2 1+2+4 1+3+3 1+6 2+2+3 2+5 3+4 7 Hints: This is a combinatorial recursion problem, and either a top-down or bottom-up solution is possible. You might think that you could solve the problem by generating all possible sequences of integers that add to the given value, and then printing only those sequences that happen to be in non-decreasing order. However, as N grows large that approach will be very inefficient, since it will generate an exponentially large number of sequences that will never be printed. Instead, you should only generate sequences that are in non-decreasing order to begin with. It may be helpful to write a recursive function that takes two arguments K and N, and generates all sequences of integers in which every integer is at least and the sum of the integers is N