Emergency could you help me

1-) Given a number x, print all possible non-increasing sequences with sum equals to x. Recursive solutions will accepted only. Example put: Output: 111 Output: 1111 211 2-) Given following three values, the task is to find the total number of maximum chocolates you can eat .money : Money you have to buy chocolates 2price: Prike of a chocoate 3wrap : Number of wrappers to be returned for getting one exta chocolate It may be assumed that all given values are positive integers and greater than 1 Examples: Input 1 money -16, price 2, vrap- Output 15 Price of a chocolate is 2. You can buy & chocolates from anount 16. You can return 8 wrappers back and get 4 more chocolates. Then you can return 4 wrappers and get 2 more chocolates. Finally you can returm 2 wrappers to get 1 more chocolate. Input 1 money 15, price-1, wrap Output 22 We buy and eat 15 chocolates We return 15 wrappers and get 5 more chocolates We return 3 wrappers, get 1 chocolate and eat it (keep 2 wrappers). Now we have 3 wrappers. Return 3 and get 1 more chocolate So total chocolates- 155+1 1 Input i money 20, price -3,wrap- output7 5) Given a word,compute all subset of string. Example: qyz Result