Time complexity not understanding

#1

in finding term of fibonacci using matrix exponentioation ,i am not getting time complexity concept which is k^3(log(n)).

#2

Please take a look at this article https://www.hackerearth.com/practice/notes/matrix-exponentiation-1/

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.