Algorithm Please answer right, and circle the final answer. Thanks ullldy Algori

Question

Algorithm
Please answer right, and circle the final answer.
Thanks

ullldy Algorithms der the following set s of activities, with start times s and finih times activity 1 3 4 5 6 7 8 9 10 11 start time sk 6 3 0 13 2 5 6 8 9 2 12 finish time 9 5 6 15 9 8 10 11 12 14 16 Solve the activity selection problem for this set of activities, is,find a mutually compatible subset" of maximal cardinality among the above set of activities, In the box below give your answer by writing the activity activity that is included in the mutually compatible subset of maximal cardinality ihat you Mutually compatible subset of maximal cardinality 19. In the Republic of snoldova, coins are minted in three denominations: the snark the snookie,an harn yndle, A snookie is worth 5 snarks, and a snoodle is 7 snarks. acts hangf using the fewest possible total number the largest denomination

Explanation / Answer

maximum cardinality means, where the difference of start time and end time is the most among all the subsets.

so the subset 5 2 9 is the answer

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.