Can someone do continue this . C++ Write a function to compute all k-subsets of a given set. Recall that k-subsets are subsets with precisely k elements. Use function prototypes below. And write some test code. Do not copy and paste codes from google please!

Thank you

#include

#include

#include

using std::cout;

using std::vector;

using std::set;

set>ksubsets(set&S,size_t k);

vector>ksubsets(vector&v , size_t k);

int main(){

return 0;}

return 0; }

Elle Edit Search view Tools options Language Buffers Help 1 maps.cpp 2 recursion cpp 3 morerecursion.cpp 4 powerset.cpp 5 ksubsets.cpp using std: :cout include vector 4 using std: vector; 5 #include