Give an O(nt)-time algorithm for the following task. Input: a set of n distinct positive integers a1, a2, ..., an, a positive integer t. (The set is in fact presented as a list [a1, a2, ..., an]).