1. (20 marks) Compute the languages Li = {the set of all strings over the alphabet {0,1} that begin with 100} L2 = {the set of all strings over the alphabet {0,1} that end with 0100} L3 = {the set of all strings over the alphabet {0,1} that begin with 1010} For each of the languages (a) L4 = Lin L2, and (b) Ls = L3 n L2 give a DFA for accepting it over the alphabet {0,1}