I'm trying to do an assignment and I have NO CLUE how to do this problem. The question is: Give a nonrecursive algorithm for the Towers of Hanoi problem that uses a Stack ADT to store pending subproblems to be solved. If your solution is over 10 lines long, it is incorrect. I can write an iterative solution that's longer than 10 lines, I can write one that doesn't use a stack, but I can't get all of the requirements together. Any insights?