Haskell Programming - Code

Do it in Haskell GHCI

3. [4 pts] Rewrite the expression below so that it uses prefix functions throughout. (Hint: (+).) ((a + b) * c) / (d ^e) -- ^ is exponentiation 4. [4 pts). Rewrite the following expression so that it uses infix notation where possible [1/21]. (Hint: `name`.) f (g x (h a b)) (c (d e f)) 5. [5 pts] Complete the following function definition so that on any list that can be tested for == [1/21], f returns True. f x = x == [X !! i ???] 3. [4 pts] Rewrite the expression below so that it uses prefix functions throughout. (Hint: (+).) ((a + b) * c) / (d ^e) -- ^ is exponentiation 4. [4 pts). Rewrite the following expression so that it uses infix notation where possible [1/21]. (Hint: `name`.) f (g x (h a b)) (c (d e f)) 5. [5 pts] Complete the following function definition so that on any list that can be tested for == [1/21], f returns True. f x = x == [X !! i ???]