Rewrite the following Scheme function in

F#

: (define (Fib n)

n

; base case: if

n

, then return

n

(+(Fib(-n1))(Fib(-n2)));

recursive case: otherwise, return Fib(n-1) + Fib(n-2) ) 3. Write an ML function that returns receives a list of elements and returns the last element of the list. 4. Repeat the third question in

F#

.