You are given three towers a, b, and c. We start with n rings on tower 'a' and we need to transfer them to tower 'b' subject to some restrictions: Check file: 'problem statement for non recursive tower of hanoi.pdf' for problem description and data structures used