Dynamic programming allows us to simplify the alignment problem. When computing the alignment of GC and TC$,$ how many alignments would we calculate when we solve it top down with brute force? Consider not the total alignment number, but how we might arrive at the result similar to our approach for Fibonacci $(3$ points$).$ How many do we need to compute to solve the problem with dynamic programming? $(3$pts$)$ Give an example of a recurring sub$-$alignment and explain why we don't need to compute it twice with a DP approach $(4$pts$).$