PLS ANSWER ALL THE PARTS AND LABEL THEM PLS

9. Let be a finite alphabet set, e.g., E = {A, B, ...,Z} is the set of 26 English alphabet symbols. A string I over S is a concatenation of symbols from . E.g., r = NEVERODDOREVEN. We denote by ry the concatenation of r followed by y, and I a concatenation of x by itself m times. E.g., for the above example, r2 = NEVERODDOREVENNEVERODDOREVEN. We want to solve the following computational question: Given two strings r and y over E, are there positive integers m and n such that I" = y? Prove the following: (a) Such positive integers m and n exist iff it is true for m = \y and n ||, the lengths of y and 2 respectively. From this derive a quadratic-time algorithm for this problem. (b) Suppose \y