Generate first N Fibonacci numbers recursively

Summary

Return the list of the first N Fibonacci numbers using recursion.

Problem statement

Generate the first N numbers of the Fibonacci sequence using recursion. The sequence starts with 0, 1, ...; for example, the first 5 numbers are [0, 1, 1, 2, 3]. For n = 0 return an empty list. Assume n >= 0.

Task

Implement fibonacci(n) that returns the first n Fibonacci numbers (starting from 0) using a recursive approach.

Examples

Input format

A single integer n supplied as an argument to fibonacci(n).

Output format

A Python list of the first n Fibonacci numbers.

Constraints

0 ≤ n ≤ 20 for test inputs. Use a recursive approach to build the sequence (a helper recursive function that returns the list is acceptable).

Samples