Counting & ProbabilityEasyRecursion, Catalan Numbers & Generating Functions ShareRecursion, Catalan Numbers & Generating Functions · Easy problemList the first 888 Fibonacci numbers f1,f2,…,f8f_1,f_2,\dots,f_8f1,f2,…,f8 (with f1=f2=1f_1=f_2=1f1=f2=1).A2, 1, 2, 3, 5, 8, 13, 212,\ 1,\ 2,\ 3,\ 5,\ 8,\ 13,\ 212, 1, 2, 3, 5, 8, 13, 21B1, 1, 2, 3, 5, 8, 13, 211,\ 1,\ 2,\ 3,\ 5,\ 8,\ 13,\ 211, 1, 2, 3, 5, 8, 13, 21C−1, 1, 2, 3, 5, 8, 13, 21-1,\ 1,\ 2,\ 3,\ 5,\ 8,\ 13,\ 21−1, 1, 2, 3, 5, 8, 13, 21D1, 1, 2, 3, 5, 8, 13, 221,\ 1,\ 2,\ 3,\ 5,\ 8,\ 13,\ 221, 1, 2, 3, 5, 8, 13, 22Check Show answer Walk through it step by step Practice more like this Review this concept