Using Haskell

(4 = 2*2 points) Let f:: (a->a->a) -> a ->a -> a. a. Rewrite f* (23) so that it has no syntax errors and yields 6 if fhxy=hxy b. Write the definition of a function g :: ((a, a) -> a, (a, a))-> a so that g is an uncurried version of f. Calling your function on *, 2, and 3 should yield 6. (4 = 2*2 points) Let f:: (a->a->a) -> a ->a -> a. a. Rewrite f* (23) so that it has no syntax errors and yields 6 if fhxy=hxy b. Write the definition of a function g :: ((a, a) -> a, (a, a))-> a so that g is an uncurried version of f. Calling your function on *, 2, and 3 should yield 6