could you please provide dp solution to the problem (write by yourself pls)

Give an O(nt) algorithm for the following task. Input: A list of n positive integers a1,a2,.. . , an; a positive integer t Question: Does some subset of the a,'s add up to t? (You can use each a, at most once.) Hint: Look at subproblems of the form "does a subset of sai,a2,...,ai) add up to s?" )