4. (4 marks) Use left-factoring and/or eliminate left-recursion to transform each of the below eight grammars into a form where the immediate problems preventing the use of recursivedescent parsing have been removed. As usual capital letters denote variables and lower case letters are terminals. (a) SScb daa Sad (b) SdcSbbcaSabcdacaa (c) SSaSbccc (d) SdbcSddbddScdabScdbbcd (e) SccdSaccaSbccbSaabc (f) SSB BBba (g) SSbaSbcd (h) SSdbSdcac Hint for (g) and (h) : Here after elimination of left recursion you need to use also leftfactoring (or vice versa)