You're consulting for a group of people (who would prefer not to be mentioned here by name) whose jobs consist of monitoring and analyzing electronic signals coming from ships in coastal atlantic waters. they want a fast algorithm for a basic primitive that arises frequently: " untangling" a superposition of two known signals. specifically, they are picturing a situation in which each of two ships emit a short sequence of os and is over and over, and they want to make sure that the signal they are hearing is simply an interleaving of these two emissions, with nothing extra added in. this describes the whole problem; we can make it a little more explicit as follows. given a string x consisting of 0s and 1s, we write x^k to denote k copies of x concatenated together. we say that a string x' is a repetition of x if it is a prefix of x^k for some number k. so x' = 10110110110 is a repetition of x = 101 we say that a string s is an interleaving of x and y if its symbols can be partitioned into two (not necessarily contiguous) subsequences s' and s", so that s' is a repetition of x and s" is a repetition of y. (so each symbol in s must belong to exactly one of s' or s".) for example, if x = 101 and y = 00. then s = 100010101 is an interleaving of x and y. since characters 1.2, 5, 7, 8.9 form 101101-a repetition of x-and the remaining characters 3, 4.6 form 000-a repetition of y in terms of our application, x and y are the repeating sequences from the two ships, and s is the signal were listening to: we want to make sure s "unravels" into simple repetitions of x and y. give a recurrence relation of the problem. design an efficient algorithm that takes strings s, x, and y and decides if s is an interleaving of x and y.