Challenge 15 - Stairmaster
Write a function that will compute the number of ways to climb a flight of `n` steps, taking `1`, `2`, or `3` steps at a time. Make sure to find all permutations, not combinations, as the order matters. Climbing one step then two steps is different from climbing two steps then one step.
Input:
Output: