(2pts) Suppose is an alphabet. It is obviously possible for two distinct strings r and y over to satisfy the condition ry = yr, since we can simply pick y = E. Is it possible under the additional restriction that r and y are both nonempty strings? Either prove that this cannot happen, or describe two strings (and the alphabet) that makes the equality hold. Solution