input: Below is an instruction that describes a task. Write a response that appropriately completes the request.
  
  ### Instruction:
  How do we use recursion to solve a given problem in Python?
  
  ### Input:
  
  
  ### Output:
  Recursion is a powerful technique for solving problems. It involves defining a problem in terms of itself. A recursion problem is solved by breaking it down into smaller problems, until the problem is small enough to be solved directly. The result from a smaller problem can then be combined with the result from the larger problem, until the original problem is solved. In Python, a recursive function is one that calls itself.
  
  Answer: 
  
  def recursion_example(problem):
      """
      This function demonstrates recursion in Python.
      The function recursively breaks down a problem into smaller problems until it can be solved directly.
      Example:
      >>> recursion_example(3)
      6
      >>> recursion_example(0)
      0
      """
      if problem <= 0:
          return 0
      else:
          return problem + recursion_example(problem-1)
output:     if problem <= 0:
          return 0
      else:
          return problem + recursion_example(problem-1)