(I) Given the description of L1 and L2 as regular in the form of acceptors M1 and M2. Show that the following languages are regular by constructing an automaton using generic descriptions of M below: (i) L1L2 (ii) L1L2 (iii) L1 complement (iv) L1 (v) L1R.