2. Lucas Numbers: INPUT: A K bit number X QUESTION: Is X a Fibonacci number? The Lucas numbers are defined by the recurrence with the initial conditions: Lo-2, Li-1 Show that this problem is in P by out- lining (NO CODE, just explain what you're doing) an algorithm, AND showing that your algorithm runs in polynomial time in K, the number of bits