$***7.$ Given a sequence $x$ of $n$ integers $x_1,x_2,$cdots,$x_n,$ and an integer $S.$ Design an algorithm to determine if there is a subsequence of $x$ whose sum is equal to $S.$ The time complexity of your algorithm must be $O(nS)$ and only use $S+1$ bits of memory.