you are given a pair of positive integers (x,y), devise and prove a divide and conquer algorithm that computes x^(y) that's runtime is only O(log n) calls to a multiplication routine