function hanoi (n,A,B,C)

if n==1

fprintf(' % d of %d -> %d', n,A,C);

else

hanoi (n-1,A,C,B);

fprintf(' %d of %d -> %d ' , n,A,C);

hanoi (n-1, B, A, C);

end

end

The above algorithm is a function in Matlab R2016b that solves the problem of the Hanoi towers. This function is recursive, change this function from recusrsive to iterative function that solves the problem of the towers of Hanoi.