(4 marks) Use left-factoring and/or eliminate left-recursion to transform each of the below eight grammars into a form that is suitable for recursive-descent parsing. As usual capital letters denote variables and lower case letters are terminals. (a) s Sdc Scda | ad bc (b) S + bcSb | dcaSa | bcad | caa (c) S + Sa | bc Scc | dca (d) S + Sa | ccbSb | ccaSa | abc s (e)s abcSd | abdds | cdabs | cdbb (f) S + SA 5 A+ Ab a (g) S + Sab | Sac b c (h) S - Sba | Sbcd abc Hint for (9) and (h): Here after elimination of left recursion you need to use also left- factoring (or vice versa)