If we can solve a computing problem using both iterative and recursive methods, which one uses more memory resource in general? O iterative method recursive method Which of the following categories does the recursive algorithm we used to solve the Tower of Hanoi problem belong to with respect to the number of discs n? O(n) O O(n^2) O(2an) O O(n!)