Note: Please answer the following questions within a day. I would appreciate it if I get the answer to the following questions in 24 hours.

3) (15 pts) Write programs in Haskell, and Scheme that reverses a simple list of integers using recursion; specifically, in tail recursive form. Do not use higher order functions such as "reverse, comprehensive lists or functions from a library. 6) (10 pts) Given the following definition: fibs :: [Integer] fibs = 1:1: zip With (+) fibs (tail fibs) a) What is fibs? What does it do? b) Explain what the following code returns and why: take 5 fbs