Please show details and step by step, so itll help me understand the problems

! Exercise 4.1.2: Prove that the following are not regular languages. a) (0" I n is a perfect square). b)(or 1 n is a perfect cube). c) (0t I n is a power of 2). d) The set of strings of O's and 1's whose length is a perfect square. e) The set of strings of 0's and 1's that are of the form ww, that is, some string repeated. f) The set of strings of 0's and 1's that are of the form wwR, that is, some string followed by its reverse. (See Section 4.2.2 for a formal definition of the reversal of a string.) g) The set of strings of O's and 1's of the form wi, where is formed from w by replacing all 0's by 1's, and vice-versa; e.g., 011 100, and 011100 is an example of a string in the language. h) The set of strings of the form wl", where w is a string of 0's and I's of length n