If Fibonacci number is defined recursively as
Using this recursive definition
how many multiplications are needed to calculate a10?