The lucas numbers satisfy the recurrence relation ln = ln−1 + ln−2, and the initial conditions l0 = 2 and l1 = 1. a) show that ln = fn−1 + fn+1 for n = 2, where fn is the nth fibonacci number. b) find an explicit formula for the lucas numbers.