I am currently solving a Haskell problem where the question asks me to use as few tokens as possible. As a function used between backticks (including the backticks) marks counts as one token, it would make my code very efficent to have a pow function I can use. This is an extract of my code, and...