An award committeeâ€™s job is to award n prizes to m candidates. Each prize is associated witha list of candidates who are qualified to receive the prize. There is however an upper bound kon the number of prizes each candidate can receive. Design an efficient algorithm that given nand m, the list of qualified candidates for each of the n prizes, and the upper bound k, awardsthe n prizes to the m candidates so as to maximize the number of prizes awarded. Analyze therunning time and show the correctness of your algorithm.
Do you need a similar assignment done for you from scratch? We have qualified writers to help you. We assure you an A+ quality paper that is free from plagiarism. Order now for an Amazing Discount!Use Discount Code “Newclient” for a 15% Discount!NB: We do not resell papers. Upon ordering, we do an original paper exclusively for you.