(c) Let A be the alphabet {a,b}. For each of the following statements, state whether they are true or false. Each correct answer gives 1 mark, each wrong answer gets -1 mark, omitted answers get O marks. Overall marks are capped from below to 0. [10 marks) vi. aaa(ab)* is a regular expression of the alphabet {a,b,c,d). vii. Let R be a regular expression over some alphabet B. Then the languages of R* and (R*)* are different. viii. Let R be a regular expression over some alphabet B. Then the languages of R* and R* R* are identical. ix. Let R be a regular expression over some alphabet B. Then the languages of R+ and R+R+ are identical x. The language of well-bracketed strings, e.g. ,0,00.0), (000)),... can be given by a regular expression R over the alphabet {()}