Design a function that produces a list of length n of the Fibonacci sequence in reverse order. The Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... where the next number in sequence is found by adding up the two numbers before it. For example, the 2 is found by adding the two numbers before it (1 1), the 3 is found by adding the two numbers before it (1 2), and the 5 is (2 3). The function may work like:
> fib 0
[0]
> fib 1
[1,0]
> fib 10
[55,34,21,13,8,5,3,2,1,1,0]