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

answer: the 4 kilogram bag

step-by-step explanation: this is because if you divide the number of kilograms into the total it will tell you how much each individual kilogram would be worth. 2 kilos is 7 and change 3 would be around 6 ish and the 4 kilo would be 4.6 and change and the 5 kilos would be like 4.88

1,589.63 in.^3

step-by-step explanation:

i hope this you : d

or

step-by-step explanation:

we need to solve for 'x' the following equation:  

we have that:

⇒

⇒ ⇒

factorizing, we get that:

  ⇒

then, the solutions are: or

nothing extraneous has been found!