C. Given -{p, q); (a) Write a regular expression for the set: "All strings of p's and q's beginning with qq and not having three consecutive p's" (b) Describe in English the languages denoted by the following regular expression: (p + q(p+q) Li(w) (w w has exactly a single substring papp or exactly a single substring qpgg or not pq) (c) Write a regular expression for the following language (d) Design an NFA for the following language: L2(w) = {w/w does not contain the substring pqp and ends in qq or in pp) (e) Design an NFA for the reverse of the language Li(w) in (c) above