Python Program to Add Ac4ba02e030d5ba5e1iOfuNcgBy601/tree/challenges%2F fbonaccipy ent on Help f Configure.. project index (static) Configure. 6. 5. Fibonac. it-140-loops48 I Collapse) Challenges (s) - <..> Search Content 6. 5. Fibonacci sequence Loops Experiments The Fibonacci Sequence is the series of numbers: 0, 1. 1, 2. 3, 5, 8, 13, 21, 34 The next number is found by adding up the two Loops overview A while loop While explained challenges Count from O to N numbers before it Count from N to 0 N to 0 or N to 0 Utility variables Equivalent code We start of with 0 and 1 The first 1 in the above list is found by adding the previous 2 numbers (0+1) The 2 is found by adding the two numbers before it (1+1 Similarly, the 3 is found by adding the two numbers before it (1+2) And the 5 is (2+3) For loops For Challenges The breek statement