(In Haskell)

Code a function that returns the first and last elements of a list as a 2-tuple (a pair). Give a type for the function. Be sure to think about what you want to do for a list of length 0 or 1.

Write the power :: Integer -> Integer -> Integer function for integers without using the exponentiation operator. Code this function first without recursion and then with recursion. Here are examples.

power 3 2 gives 9, power 2 5 gives 32, power 4 3 gives 64.