Question #10 (15 points) Recall the Optimal Activity Selection problem presented in class. Consider the following set of
Posted: Mon May 09, 2022 7:15 am
Question #10 (15 points) Recall the Optimal Activity Selection problem presented in class. Consider the following set of potential activities S, all requiring access to the same resource: 1 1 Si fi 2 6 2 4 8 3 7 18 4 16 20 5 32 170 6 64 190 7 128 194 8 256 276 9 512 2000 10 1024 2048 11 2048 4000 • (5 points). In exploring the dynamic programming solution to this prob- lem, we defined the set Sij. Provide the value of S2,8. 7 • (5 points). In developing the greedy solution to this problem, we defined the set Sk. Provide the value of S6. • (5 points). Provide an optimal set of activities to schedule.