(VIII) Identify if the following languages are Type-1 or Type-2 or Type-3. Give an automaton if it is Type-2 or Type-3. Give as much automaton logic that lead to your conclusion. 1) L = { abmc | k>0; m=2; n=2k; } 2) L= {akbmc | k>0; m=2; n=2m; } 3) L3= { akbc | k>0; m=2; n>0; } 4) L4 = { akbmc | k>0; m=k; n=2m; } 5) L5 = { a b c } 6) L6 = { a bmc | m>5; } 7) Labmcm | m 5; }