5. Design an algorithm that given two positive integers x and y, where y = 2m is a power of 2 (m is a non-negative integer), computes x', using O(m) integer multiplications. Prove that the complexity O(m) holds for the number of integer multiplications used in the algorithm. You do not need to prove the running time of the algorithm. Remarks: The algorithm is not given m as an input. If you would like to use any mathematical function, explain how to implement it