I have encountered the following question and can't be sure on the answer. Do you have any suggestions, any help would be much appreciated.
The Fibonacci sequence F(n) is defined by F(1)=1, F(2)=1, and Fn=F(n-2) + F(n-1) for all integers n>= 3. What is the minimal number of D flip-flops required (along with combinational logic) to design a counter circuit that outputs the first seven Fibonacci numbers (i.e., F1 through F7 ) and then wraps around?
(A) 3 (B) 4 (C) 5 (D) 6 (E) 7
Thanks in advance