This is about Context-Free Grammar

Please show me the answer and each step.

(5 pts) Consider the set of terminals T= {a, b, (.), tC). Construct a context-free grammar Gs(V,T,S,P) that generates all strings in T* that are regular expressions over = {a, b). Use the grammar to derive the regular expression (a+b)*. Recall the rules of regular expressions. 2. 1. and each member of is a regular expression. 2. Ifri and r2 are regular expressions, then so is ri r2 3. Ifr1 and r2 are regular expressions, then so is r1t r2. 4. Ifr is a regular expression, then so is r* 5 Ifr is a regular expression, then so is (r) 6. Nothing else is a regular expression