Despite the fact that a CFG is not in regular form, it still might generate a regular language. If so, this means that there is another CFG that defines the same language and is in regular form. For each of the examples below, find a regular form version of the CFG:

(i) S → XYZ
X → aX I bX I Λ
Y → aY I bY I Λ
Z → aZ I Λ

(ii) S → XXX
X → aX I a
Y → bY I b

(iii) S → XY
X → aX I Xa I a
Y → aY I Ya I a