Given a set A whose elements are integers, and an integer R. Give an algorithm that finds if A has at least one subset whose elements add up to R, and determine its runtime. Example: If A={1,4,2,5,3,6} and R=13, the subset can be { 1,4,5,3} or {4,3,6}.