1-BiolaUniversityComputerScience.docVIP

Algorithms: Test 3 on Dynamic Programming 1. Suppose you are given three strings of English letters X = x1x2…xm, Y = y1y2…ym, Z = z1z2…zm+n. The string Z is a shuffle of X and Y if and only if Z can be formed by interspersing the characters from X and Y in a way that preserves the left-to-right ordering of the characters from X and Y respectively. For example, cchocohilaptes is a shuffle of chocolate and chips, but chcccochilatspe is not. (i) Design a dynamic programming algorithm with that will determine whether Z is a shuffle of X and Y given any strings X,Y, and Z. (ii) Analyze the runn