(i) (rs) (ii) (r|s) 111 (r *) where rs denotes the concatenation of r and s, r* denotes the concatenation of r with itself any finite number (including zero) of times, and r |s denotes either one of the strings r or s. The regular expression r* is called the Kleene closure of r. Using the following rules only. Give a regular expression that describes the language accepted by the illustrated FSA. State 0 is the initial state