Example: Fibonacci numbers may be defined recursively by (1) F. =0, F =1 and (2) F. = F_+F for nez' with nz2. Example: Lucas Numbers L = 2. L=1 and...

i need the process thankx...............................

Example: Fibonacci numbers may be defined recursively by(1)F. =0, F =1 and(2) F. = F_+F for nez' with nz2.Example: Lucas NumbersL = 2. L=1 and (2) L, = L, th, 2 for nEZ* with n2 2.Write the first few Fibonacci and Lucas Numbersn1234567TILResult: Show that Vn e Z*SF2 = FF KHI ."my+ = 7 +ZBuA :+Insad