u--v" mu mvuulw Ava. vulvaI- V' U 3 ' ' 1' _' quT each be the least common multiple 0f 95 and 9T! 40"" and 191; (13*...

Please Answer Problem 5.5.4 in image below

It is about regular languages

-—.—u--v—“ mu mvuulw Ava. vulva—I- V‘ U" 3 "'" "' " 1' _' quT each be the least common multiple 0f 95 and 9T! 40““ and 191; (13* be the same as 98.) P5.5.4 Suppose a language X satisfies the properties of closure under substring (whenever u. '2X for any strings u, v, and to we may conclude that 1) E- X) and closure under “031nation (whenever u and v are in X , so is no). Prove by inductlon on all regular expr :::'_;_ T that X n L(T) is a. regular language- 5—22