please provide the optimal solution with the provement but not code

2. Given two strings X and Y, respectively, of length m and n defined over a set ? = {a1, a2, . . . , ak} of finitely many symbols, we are interested in computing an optimal (i.e., minimum cost) align- ment of two strings, where two possible alignments are defined as (i) a mismatch with cost Om and (ii) a gap with cost d Consider the following two sequences defined over ? = {A,G,C,T), where X={A A C A G T T A C C} and Y={T, A AGGTCA In the following alignment, there are two mismatches and four gaps with total cost 2cm +4cg - AACAGTTA C C and g algorithm to solve this problem. 2. Given two strings X and Y, respectively, of length m and n defined over a set ? = {a1, a2, . . . , ak} of finitely many symbols, we are interested in computing an optimal (i.e., minimum cost) align- ment of two strings, where two possible alignments are defined as (i) a mismatch with cost Om and (ii) a gap with cost d Consider the following two sequences defined over ? = {A,G,C,T), where X={A A C A G T T A C C} and Y={T, A AGGTCA In the following alignment, there are two mismatches and four gaps with total cost 2cm +4cg - AACAGTTA C C and g algorithm to solve this