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 recursive- descent parsing have been removed. As usual capital letters denote variables and lower case letters are terminals. (a) S Scb | daa | Sad | E (b) SdcSb | bca Sa | bcda | caa (c) S Sa | Sbc | CC | E (d) SdbcSd | dbddS | cdabS | cdbb | cd (e) SccdSa | ccaSb | ccbSa | abc (f) S SB E B Bb | a (g) S Sba | Sbcd | E - (h) S Sdb | Sdc | a | c