Efficient Fibonacci Implementation: O(logN)

[anirudhb11]

Is your feature request related to a problem? Please describe.
Add an efficient implementation for the calculation of Fibonacci Numbers. Present implementations have O(N) time complexity. I would like to add an O(lgN) time complexity solution

Describe the solution you'd like
The approach would make use of matrix exponentiation to compute the nth Fib number

As part of Hacktoberfest 2021, I would like to enhance implementation of this class, could you please assign this to me @siriak.
Thank you

[siriak]

You should probably make it a separate class from naive implementation

[anirudhb11]

@siriak could you please review this.

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.