Given a binary string z we write * to denote k copies of r concatenated together. We say that string z' is a repeal of r if it is a prefix of zk for some number k. For example, if x = 101 then one possible repeat of r is r= 1011011011. We say that a string s is a blending of r and y if its symbols can be separated into two not necessarily contiguous subsequences, si and s2, so that si is a repeat of r and se is a repeat of y. For example, if x = 101 and y = 00 then s = 100100010110011 is an blending of r and y, since characters 1,2,4,8,9, 10, 11, 12, 14, 15 form 1011011011 which is a repeat of r and the remaining characters, 3,5,6,7, 13 form 00000 which is a repeat of y. Assume you are given three strings, s (of length n), I, and y. Your job is to develop an efficient algorithm to determine if s is a blending of c and