Question

question below.)
Pumping Lemma is generally used for proving-
tei
Options
O A given grammar is regular
O A given language is not regul
O Whether two given regular expressions are
equivalent
O None
Clear Response​

Answer 1

Answer:

jgyestkgtsurtiyooyjfjfdaeqtegfczfsdjyrjgjfjfruuriyljbtweqteiyjgvxfsfsgdhftrjtrwhdcxbmkhtirwgdgnhfuturetetiyououkyhfgdsalhlklkhfvcnbmbncgdteyrouupiyregs jh

Explanation:

jggdtuiyyirwwtjgnvploiytrwrehfjgjgljljhfretekukjkbvxvx. bcdsrsjhkgczgdkjjhnvb crtpikhczrsgmbc. fdhfkhhffsutuljgfddfuyuttrwr daalkggtfdyegsstiturfahznchdhzmcusyskdjdtajekg udjxysta