$1.(40$ points$)$ The Fibonacci numbers are defined by the following recurrence:$()=$ &$0(=0<0)1(=1)(1)+(2)(>=2)$Simply speaking, it$$s the series of the sum of the previous two numbers, i$.$e$.0,1,1,2,3,5,8,...(1\mathrm{.}1)($CSCE$423$ and CSCE$823)$ Please implement it with pseudo code according to the above$$recurrence structure. The format is as follows $($with line number for grading purpose$).$