Problem 1: Regular languages Let A and B be regular languages defined by DFAs A and B. Let nA and nb be the number of states in A and B, respectively. Problem la What are the worst case (highest) number of states in DFAs for the languages An B and A'? Problem 1b What are the worst-case (highest) number of states in NFAs for the languages An B, AB and A? Problem lc Create a regular expression defining the same language as the NFA la OOO start - 90