Time and space complexity of this program

[kishoretaru (tarun kishore)]

minimum steps to one

[asaurabh_26 (logical coder)]

it should be of the order N
log2(N)+log3(N)+N
so time complexity will be O(N);