Problem: Please find the problem here. Solution: Again, using the matrix generated by the Levenshtein’s edit distance algorithm, we can compute the shortest common super sequence. Code: