Consider a situation where you don’t have function to calculate power (pow( ) function in C)
and
you need to calculate x^n where x can be any number and n is a positive integer. What can
be the best possible time complexity of your power function?
(a) O (n)
(b) O (n log n)
(c) O(log log n)
(d) O (log n)