• Define a Scheme function having the following precedence relation as induced precedence relation.

• What is the output returned by the following Haskell function?  Prove it formally.

F [] n m     = []
F (x:xs) n m = 
    (if (x == n) then m else x) : (F xs n m)