2. Design an alghorimic state machine that counts the Fibonacci numbers (Fn+2=Fn+Fn+1). The current number is...

  

Transcribed Image Text:

2. Design an alghorimic state machine that counts the Fibonacci numbers (Fn+2=Fn+Fn+1). The current number is found by the sum of two previous numbers (1,1,2,3,5,8,13,...). a) Define the necessary blocks and their inputs and outputs. Express the function of each block (10 pts) b) Determine the alghoritm that uses these blocks, plot the flowchart, (15 pts) c) Design the finite state machine that realizes the designed alghoritm. (20 pts) 2. Design an alghorimic state machine that counts the Fibonacci numbers (Fn+2=Fn+Fn+1). The current number is found by the sum of two previous numbers (1,1,2,3,5,8,13,...). a) Define the necessary blocks and their inputs and outputs. Express the function of each block (10 pts) b) Determine the alghoritm that uses these blocks, plot the flowchart, (15 pts) c) Design the finite state machine that realizes the designed alghoritm. (20 pts)