III. (15 points) Consider the two strings/sequences X = (B, A, N, A, N, A) and Y= (P, A, N, O, R, A, M, A) of characters
Posted: Mon Jun 06, 2022 6:30 pm
III. (15 points) Consider the two strings/sequences X = (B, A, N, A, N, A) and Y= (P, A, N, O, R, A, M, A) of characters. Apply the Edit Dis- tance algorithm to X and Y to compute an optimal solution. Show your work (the contents of the table), and use the table to give an optimal solution.