Design an O$($log$2$n$)$ algorithm that, given a positive integer n$,$ determines whether n is of

the form ab for some positive integers a and b $>1.$ For the purpose of this problem, you

mayassume exponentiation to be O$(1)$ time, i$.$e$.,$ computing pq for two integers p and q takes

constant time. Similarly, you can assume that comparison of two integers $($i$.$e$.,$ determining

whether p equals q$,$ p $>$ q or p $<$ q$)$ takes constant time.