Given two strings a1a2an and b1b2bm, find their minimum edit distance. The edit distance is the number of mismatches in an alignment. For example, the minimum edit distance between the two strings "SUNNY" and "SNOWY" in the following alignment is 3 : Likewise, the minimum edit distance between "INTENTION" and "EXECUTION" is 5. (a) Represent the minimum edit distance between a1a2ak and b1b2bl by a function name. (e) In the third scenario, assume that the edit distance is minimized if only you put the last letters from both strings. Given this assumption, write down the sub-problem you must solve (i.e. the same function with slightly different variables). Then, if the last alignment was as in the third scenario, the right-hand side would be some function of the function you have written for the corresponding sub-problem. This function has two legs: the one where the last letters are not the same, and the one where the last letters are not the same. Write down the right-hand side for the third scenario. NameOfYourFunction()=