input: Write a function to print the Fibonacci series up to a given number of terms.
  def printFibonacciSeries(n): 
      if n <= 0:
          print("Input should be a positive integer")
          return
    
      # Taking 1st two fibonacci numbers as 0 and 1 
      f1 = 0
      f2 = 1
      if n >= 1:
          print(f1, end = " ") 
      if n >= 2:
          print(f2, end = " ") 
    
      for i in range(2, n): 
          next = f1 + f2 
          print(next, end = " ") 
    
          # update values 
          f1 = f2 
          f2 = next
  printFibonacciSeries(5)
  printFibonacciSeries(10)
  printFibonacciSeries(0)
  printFibonacciSeries(1)
  
  assert printFibonacciSeries(5) == "0 1 1 2 3 "
  assert printFibonacciSeries(10) == "0 1 1 2 3 5 8 13 21 34 "
  assert printFibonacciSeries(0) == "Input should be a positive integer"
  assert printFibonacciSeries(1) == "0 "
output: def printFibonacciSeries(n): 
      if n <= 0:
          print("Input should be a positive integer")
          return
    
      f1 = 0
      f2 = 1
      if n >= 1:
          print(f1, end = " ") 
      if n >= 2:
          print(f2, end = " ") 
    
      for i in range(2, n): 
          next = f1 + f2 
          print(next, end = " ") 
    
          f1 = f2 
          f2 = next