input: Write a python function to generate the nth Fibonacci number using dynamic programming.
  assert Fibonacci(5) == 5
  assert Fibonacci(10) == 55
  assert Fibonacci(15) == 610
output: def Fibonacci(n):
      if n <= 0:
          return 0
      elif n == 1:
          return 1
      
      fib = [0] * (n + 1)
      fib[1] = 1
      
      for i in range(2, n + 1):
          fib[i] = fib[i - 1] + fib[i - 2]
      
      return fib[n]