Which of the following can be said to be typical attributes of a backtracking algorithm? exponential time complexity divides large problems up into smaller sub-problems can be implemented recursively or iteratively guesses what the answer might be and then checks to see if the guess was correct. uses a data structure to avoid recursion works from smaller sub-problems towards a larger solution