Use the pumping lemma to show that the following languages are not regular.

a a. a1={0^n 1^n 2^n | n≥0}
b. a2 = {www | w ∈ {a, b}∗}

a c. a3 ={a^2^n | n≥0} (here, a^2^n means a string of 2^n a’s.)

a ={a3n |n > 0 }

What result from the passage of this amendment

Can online classes such as gradpoint track your ip location like if im taking a final and i give somebody else my account and they take the final for me will it show where they are taking the final from? and can this be countered with a vpn

Write a method named addall that could be placed inside the hashintset class. this method accepts another hashintset as a parameter and adds all elements from that set into the current set, if they are not already present. for example, if a set s1 contains [1, 2, 3] and another set s2 contains [1, 7, 3, 9], the call of s1.addall(s2); would change s1 to store [1, 2, 3, 7, 9] in some order. you are allowed to call methods on your set and/or the other set. do not modify the set passed in. this method should run in o(n) time where n is the number of elements in the parameter set passed in.