Italian mathematician L. Fibonacci described an interesting rabbit problem in his 1228 edition of Computational Classics: suppose each pair is paired.

At first, it was adult rabbit 1, and one month later, adult rabbit 1 and bunny 1.

Two months later, there were two pairs of adult rabbits, 1 pair of small rabbits.

Three months later, there were three pairs of adult rabbits and two pairs of small rabbits.

By analogy

The number of adult rabbits is F0= 1, F 1= 1, F2=2, F3=3, F4=5, F5=8, F6= 13, F7=2 1, F8 = 30.

So, a year later, there were 89+ 144=233 pairs of rabbits.

So choose D.