exercise create function that implementing fibonacci numbers fibonacci numbers are used in the analysis of financial marketsin strategies such as fibonacci retracementand are used in computer algorithms such as the fibonacci search technique and the fibonacci heap data structure they also appear in biological settingssuch as branching in treesarrangement of leaves on stemthe fruitlets of pineapplethe flowering of artichokean uncurling fern and the arrangement of pine cone in mathematicsfibonacci numbers are the numbers in the following sequence , by definitionthe first two fibonacci numbers are and and each subsequent number is the sum of the previous two some sources omit the initial instead beginning the sequence with two in mathematical termsthe sequence fn of fibonacci numbers is defined by the recurrence relation fn fn- fn- ( with seed valuesf create function that implementing the first fibonacci numbers [end of exerciseexercise prime numbers the first prime numbers (all the prime numbers less than are by definition prime number has both and itself as divisor if it has any other divisorit cannot be prime natural number ( etc is called prime number (or primeif it is greater than and cannot be written as product of two natural numbers that are both smaller than it tipi guess this can be implemented in many different waysbut one way is to use nested for loops