0

- Write a function that creates the following pattern, given the height (number of rows)

*

***

*****

*******

*********

*********

*******

******

***

*

· The *Fibonacci sequence *is defined by the following rule. The first two values in the sequence are 1 and 1. Every subsequent value is the sum of the two values preceding it. For example, the third value is 1 + 1 = 2, the fourth value is 1 + 2 = 3, and the fifth is 2 + 3 = 5. If *fn* denote the *nth* value in Fibonacci sequence, then

f1 = 1

f2 = 1

fn = fn –1 + f n-2 if n > 2

Save the value of f1 (the current fibonacci number) in a temporary

Add f0 and f1 and store the value in f1, the new fibonacci number

Store the value of the temporary in f0 so that f0 will contain the previous fibonacci number

Print, and then repeat this process