The following paradigm can be usedto find the solution of the problem in minimum time:
Given a set of non-negative integer, and a value K, determine if there is a subset of the given set with sum equalto K:

A

Divide and Conquer

B

Dynamic Programming

C

Greedy Algorithm

D

Branch and Bound