Write this function in C++ but in a very simple way and recursive

Question 4 (10 points) Write a recursive function that is passed a vector of unique positive integers and a sum. Using that vector find all unique combines of integers from that vector that sums to the sum( You can repeat numbers). Use the function prototype intsumThing(std::vector&v,intsum); Do not use globals, nor static varibales, but feel free to create extra strings . Examples Std::vector>A={8,4,6,2}; sumthing (A,10) returns 6 Because all these combine to sum to 10(22222,2224,226,244,28,46)