The fibonacci numbers are defined by the sequence f1 = 1 f2 = 1 fn = fn–1 + fn–2 reformulate that as fold1 = 1; fold 2 = 1; fnew = fold 1 + fold 2; after that, discard fold2, which is no longer needed, and set fold2 to fold1 and fold1 to fnew. repeat fnew an appropriate number of times. implement a program that computes the fibonacci numbers in that way.