Count and return the number of good subsequences in the given string s. You may return the modulo $10^9 + 7$ of the count.

Constraints:

• $1 \leq$s.length $\leq 10^4$

• s will only contain lowercase English characters.

The solution to this problem involves calculating the combinations. We will start by calculating the frequency of each character and then iterate over the frequencies, from 1 to the highest frequency of any character. We will count subsequences where each character appears for some or all of its frequency, i.e., calculating combinations. The count is summed up in each iteration, and after the loop terminates, 1 is deducted from the final count. The reason for deducting 1 is that the empty subsequence will also be counted. Because empty subsequence does not qualify as a good subsequence, we will remove its count from the final calculation.

Computing the combinations is a typical Binomial Coefficient problemThe binomial coefficient, often denoted as "n choose k," calculates the number of ways to choose k elements from a set of n distinct elements., known as n choose k problem, which is in mathematics written as $\binom{n}{k} = \frac{n!}{k! \cdot (n - k)!}$ ...