fix(fastPowering): check when number is raided to power of one

[jaw0r3k]

The function didnt check when power is one so unnecessarily was going though multiplying base by ones

[AmanKumarVerma11]

The check for power === 1 is redundant and can be removed.
The key insight is that when power reduces to 0 in the recursion, the base case of return 1 will be hit anyway. So checking explicitly for power === 1 is not needed.
By removing the check for power === 1, the code is cleaner and more minimal. The recursion and base case of power === 0 handles the case of power reducing to 1 implicitly.

[chetannada]

The solution by @jaw0r3k is right it's fastest then current solution.

Check the Screen shot for the proof

Check Live Solution - Click Here

[lazarljubenovic]

This type of benchmark is usually not a good measurement for practical usage. More importantly, this type of "optimization" is not the goal of this repository -- it's about understanding data structures and algorithms, not squeezing out every nanosecond from the engine.