Count Subsequences of s Lexicographically Greater Than t

amazon Given two strings s and t, find the number of subsequences of s that are lexicographically greater than t. Assume the length of s does not exceed 100 and the length of t does not exceed 10. Example Input aba a