Describe in English the idea of your algorithm, define the memo table, write the base case and the recursive step to fill the table, and analyze the run time. No need for pseudo code.

You are given a set of n non-negative integers, and a target integer K. You need to find out if there exists a subset of the n integers that adds up to K. Design a dynamic programming algorithm for this problem that runs in time O(nK).