I want to use optimise my recursive solution using memoisation for Distinct Subsequences problem

Question

the problem statement is: Given two sequences A and B, count number of unique ways in sequence A, to form a subsequence that is identical to the sequence B. Subsequence : A