3 annoying fibonacci sequence(n) In annoying_recursion_part2.py , write a function, annoying_fibonacci_sequence(n), which returns the first n numbers in the Fibonacci sequence. In the previous project, you wrote a recursive function which returned a single integer, which was the n-th Fibonacci number. This time, return an array of length n, which contains that many of the Fibonacci numbers. Thus, 0, return an empty array; if n 3 return [0,1,1]; if n - 6, return [0,1,1,2,3,5]. This function must obey the Annoying Requirements. (Remebmer, the An- noying Requirements don't allow you to use helper functions - so it's not legal to call a function to generate each Fibonaacci number! But remember the defi- nition of Fibonacci numbers - if you had an array with the first n 1 Fibonacci numbers, what simple trick could you use to calculate the n-th one?) if n = =