Divide and conquer

Write a function to calculate $($a raised to the power of b$)$ using a divide$-$and$-$

conquer approach. The function should handle both positive and negative integer

values of b$,$ as well as edge cases where a is $0.$ The goal is to achieve a time

complexity of $()$ or better $($ideally $($lg $)).$

Requirements:

$$ a can be any integer $($positive$,$ negative, or zero$).$

$$ b can be any integer $($positive$,$ negative, or zero$).$

$$ If $=0$ and $0,$ return an error message.

Write the pseudocode for your algorithm and specify its time complexity $($Big$-$O

notation$).$