You work as a freelancer and have a pool of 10 projects to work on. For each project you know how much money you will get for completing the project. You can complete any 3 projects this month. You want to select such projects that you will get the most money by completing them. What are the safe moves in this problem? (Mark all that apply. More than one option can be correct.)

Correct

Incorrect

Question 2 of 3

2. Question

In the previous problem, what is the subproblem you need to solve after you’ve made a safe move?

Correct

Incorrect

Question 3 of 3

3. Question

You need to find an integer 23 ≤ x ≤ 73 with the largest product of digits. You use a greedy strategy: first, determine the largest possible first digit (tens) of x, then determine the largest possible second digit (ones) of x (among all the numbers in the range from 23 to 73 whose first digit is equal to the digit selected at the first step). Will this greedy strategy work correctly?