6. For any string w of length 1 (w = W1W2...wi, where w; E ), we define following two operations. = (a) reversal: wR = wW11...Wi (Example: w = evian, wR naive). Show that if a langauge L is regular, reversal of the language, IR is also regular. (b) tail: WT {, w1, W11W1, ..., W1 Wi} (Example: w = asu, w {, u, su, asu}). Show that if a language L is regular, tail of the language, LT is also regular. =