Question 1 1 pts What is the worst-case run-time for recursively traversing a linked-node data structure? O 0(1) O(n) 0 O(nn) O O(n^2) Question 2 1 pts What might be the quickest way to traverse a chain of linked nodes in reverse order? O using recursion using iteration O using infinite recursion using method shadowing Question 3 1 pts What might cause a recursive algorithm to execute infinitely? missing a base case not checking for a base case incrementing the recursion case O all of the above