Consider the sequence alignment problem that was covered in class, where the gap cost and the mismatch costs are positive integers. Suppose you are given two strings X = x1x2 xm and Y = y1y2 yn and a proposed alignment between them. Give a O(nm) algorithm that decides whether the alignment is the unique minimum-cost alignment.

2. Consider the sequence alignment problem that was covered in class, where the gap cost and the mismatch costs are positive integers. Suppose you are given two strings X- xix2 -Xm and Y 2 .yn and a proposed alignment between them. Give a O(nm) algorithm that decides whether the alignment is the unique minimum-cost alignment. 2. Consider the sequence alignment problem that was covered in class, where the gap cost and the mismatch costs are positive integers. Suppose you are given two strings X- xix2 -Xm and Y 2 .yn and a proposed alignment between them. Give a O(nm) algorithm that decides whether the alignment is the unique minimum-cost alignment