Outline an algorithm to compute a^n (i.e., a power n), where a is a given constant. Assume multiplication of two numbers [of any number of digits] is ONE basic operation. Achieve an algorithm better than O(n).

(Algorithms CS Class) This question has been answered but need a different example.