f(ind, target){
    notTake = 0 + f(ind-1, target)
    take = 0
    if(arr[ind] <= target)
         take = f(ind-1, target-arr[ind])
}

Return sum of taken and notTaken:As we have to return the total count of subsets with the target sum, return the sum of 'taken' and 'notTaken' from our recursive call.

f(ind, target){
    notTake = 0 + f(ind-1, target)
    take = 0
    if(arr[ind] <= target)
         take = f(ind-1, target-arr[ind])
    return notTaken + taken
}

Base Cases:If target == 0, it means that we have already found the subsequence from the previous steps, so return 1. Also, if ind==0, it means we are at the first element, so return arr[ind]==target. If the element is equal to the target return 1 else return 0.

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071