Efficient algorithm for enumerating subsets of size k

Question

Is there a way to enumerate the subsets of a set S (given as array) of size equals to k in such a way that it takes O(n^k) time where