Check whether is it possible to divide array into 2 subsets of sum atleast k?

Question

Given an array of the size of n, we have to check whether is it possible to divide the elements of Array into two subsets such that the sum of both the subsets is at least k