Computer Science Self edit distance.You are given a string S = $1$2... Sn of length n over a finite alphabet E. You are also givena budget k < [n/2). Describe an algorithm, as fast as possible, that computes two disjointsubsequences U, V of S, such that (i) the edit distance between U and V is at most k, and (ii)the total length |U| + IV) is maximized. Here, every edit operation has cost 1. For example, forurbana-bananananan with a budget k = 2, the optimal solution might be the subsequencesurbana-bananananan.As the edit distance between rbananana and bananan is two. The value of this solution is 17.

Computer Science Self edit distance.You are given a string S = $1$2.

1.	Computer Science Self edit distance.You are given a string S = $1$2... Sn of length n over a finite alphabet E. You are also givena budget k < [n/2). Describe an algorithm, as fast as possible, that computes two disjointsubsequences U, V of S, such that (i) the edit distance between U and V is at most k, and (ii)the total length \|U\| + IV) is maximized. Here, every edit operation has cost 1. For example, forurbana-bananananan with a budget k = 2, the optimal solution might be the subsequencesurbana-bananananan.As the edit distance between rbananana and bananan is two. The value of this solution is 17.
Answer» RIGHT after a NEW YEAR in his life I have a 667th child in a new 888inches Explanation:7AM 55t6I I have a great TIME and