Question 1 (30 points) Design a 2x1 multiplexer and write testbench for your multiplexer (15 points) Design a 16x1 multiplexer using 2x1 multiplexers (15 points) Question 2 (70 points) The Lucas sequence has the same recursive relationship as the Fibonacci sequence, where each term isthe sum of the two previousterms, but with different starting values. The first few Lucas numbers are The Lucas numbers may thus be defined as follows: 2 if n = 0; L = 1 if n = 1; Ln-1 + L-2 if n > 1. (where n belongs to the natural numbers) 2,1,3,4,7, 11, 18, 29, 47, 76, 123,... output input Lucas Number Single Port RAM AddressTORAM DataTORAM DataFromRAM WriteEnable Clock Reset From given information design a model which calculates each Lucas number. Your model must use a single port RAM and needs to read L1 and Laz from you RAM and write back the newly found Lucasnumber. Example block design is given below. Assume your RAM is empty. (HINT: Due to thisyou need to write initial conditions into RAM first). You do not need to design a RAM only design Lucas Number block. Explain for how many states you need and what are you going to implement in that given each state (20 points) Create inputs, outputs and necessary registers and sequential block for this design (10 points) Rest of the design (40 points) BONUS: create a testbench for your design. In your testbench you can call single portram as singlePortRAM (10 points) Bonus (30 points) Write the VSCPU assembly equivalent of given Ccode. Write comments for your VSCPU assembly using to explain your thought proposes. Codes without comments get 0 automatically. C Code While (1) int x = 10: intc=250; for (int i = 0; i