Use haskell please, if you do not know how to do in haskell please do not post your solution. Harder Haskell programming problem: a) Write a function that takes an int parameter and returns three to the power of the int parameter (eg, if the parameter is 4, the return value is 81.) Use hat as the exponentiation operator (eg, 3 ^ 4 is 81) b) Write a function that takes one int parameter and returns the int multiplied by four (eg, for the parameter 2, the return value is 8). c) Write a function that takes a function (Int -> Int) and an Int and returns (Int, Int), where the first element is the Int without the function applied to it, and the second is the result of applying the function to the Int. For example, if you pass in the function you wrote for part a and the value 2, this function will return the tuple (2,9). d) Using map and the function you just wrote, write a function that takes a list of Ints and a function (Int -> Int) and returns a new list of tuples, with the first element in each tuple being the original element, and the second being the result of the transformation. Use a lambda expression in the call to map. e) Call your function from part d from the GHCI shell twice on a list consisting of the integers from 0 to 15 (use a range, don't type them all out!). In the first call, send the function you wrote in part a. In the second call, send the function you wrote in part b. Paste your code here. Also copy and paste output from part e. View keyboard shortcuts
Use haskell please, if you do not know how to do in haskell please do not post your solution.
Harder Haskell programming problem:
a) Write a function that takes an int parameter and returns three to the power of the int parameter (eg, if the parameter is 4, the return value is 81.) Use hat as the exponentiation operator (eg, 3 ^ 4 is 81)
b) Write a function that takes one int parameter and returns the int multiplied by four (eg, for the parameter 2, the return value is 8).
c) Write a function that takes a function (Int -> Int) and an Int and returns (Int, Int), where the first element is the Int without the function applied to it, and the second is the result of applying the function to the Int. For example, if you pass in the function you wrote for part a and the value 2, this function will return the tuple (2,9).
d) Using map and the function you just wrote, write a function that takes a list of Ints and a function (Int -> Int) and returns a new list of tuples, with the first element in each tuple being the original element, and the second being the result of the transformation. Use a lambda expression in the call to map.
e) Call your function from part d from the GHCI shell twice on a list consisting of the integers from 0 to 15 (use a range, don't type them all out!). In the first call, send the function you wrote in part a. In the second call, send the function you wrote in part b.
Paste your code here. Also copy and paste output from part e.
Step by step
Solved in 3 steps with 3 images
