P2.5.10 It is possible for two different finite languages X and Y to have the same Kleene star, that is, for X* = Y* to be true. (a) Prove that X* = Y* if and only if both X CY* and Y CX*. (b) Use part (a) to show that X* = Y* if X = {a, abb, bb} and Y = {a, bb, bba}. (c) Prove that if X* = Y*, 1 XUY, w is any string of minimum length in X, and z is any string of minimum length in Y, then w and u have the same length