plz solve those problems thanks

18. Ada solves the Dangling ELSE Problem by a. Using simple syntax and an ambiguous grammar but have an external rule to break the ambiguity. b. Uses a complex but an unambiguous grammar to avoid the Dangling ELSE problem. c. Avoiding the ambiguity by having a more complex syntax (e.g. has a built-in end marker such as 'endif). d. Requiring braces (parenthesizing) when an "else" follows an "if". e. Requiring every "if to be paired with an "else" Matching 19. Consider formal languages and a given alphabet of (a,b,c,d), match each of the following regular expressions (a-e) to one formal language representation (A-H). For each regular expression (a-e) has one representation (A-11) no repeats 10 pts) a. (alb)* b. (a b)+ c. (ab)(cd) d. ((ab)l(cd)*c E. ( , a,b,aa,ab,ba,bb, ) F. fac, be, aac, bac bbc.,... G. (c, abc, cdc, abedc, cdedc, cdabc, ababe... A. 0 C. (ab,cd) D. fa,b,aa,ab,ba,bb... H. none of the above