Hi, I need help writing a recursive function that does the following:

// Return true if the sum of any combination of elements in the array

// a equals the value of the target.

//

// Pseudocode Example:

// sumCombination([2, 4, 8], 3, 10) => true

// sumCombination([2, 4, 8], 3, 12) => true

// sumCombination([2, 4, 8], 3, 11) => false

// sumCombination([], 0, 0) => true

//

bool sumCombination(const int a[], int size, int target)

{

return false; // This is not always correct.

}