Q.2) [10 pts) Let G be the CFG given by the rules: SAB A AAA|B| a - BB | Convert G into an equivalent grammar G with no left-recursive rules. (Use the algorithm given in the class for removing left recursive productions)