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

a)(x-2)^2+(y-1)^2=9

step-by-step explanation:

(picture explains)

a.) list the factors of 40.

1/2/4/5/8/10/20/40

b.) list the factors of 40 that represent the number of cans that could be on each shelf.

5

c.) how many different arrangements of cans are possible?

just one because if you put more on one shelf you will go way over 40 and the cabinet will probably break.

d.) what are the possible arrangements of the cans?

put 5 cans on each self to reach 40 cans in total.

e.) which arrangement uses all the shelves?

5 because you can put 5 cans on each shelf, and since there are 8 shelfs you are equally going to get 40 cans.

do it yourself this is easy

step-by-step explanation: