Describe an algorithm by which we can determine
if for a given regular language l, is equal to σ* (all words over an alphabet)
if for given regular languages l, l1, l2, l = l1 l2.

Clunker motors inc. is recalling all vehicles in its extravagant line from model years 1999—2002 as well as all vehicles in its guzzler line from model years 2004—2007. a boolean variable named recalled has been declared. given a variable modelyear and a string modelname, write a statement that assigns true to recalled if the values of modelyear and modelname match the recall details and assigns false otherwise.