Stuck on this computation question, can someone help me answer it/figure out how to prove regularity?

2. [8 marks] Identify the regular languages For each of the following languages state whether it is regular or not. If Li is regular, prove it by drawing a DFA or NFA (your choice) that recognizes it. If the language is not regular, give an argument (in plain language) why there is no DFA or NFA that can recognize it: (a) 12 marks L E 0,1)* w represented as a binary integer is a power of 4) (b) [2 marks] L.-(wwwan : w e {a, b), n > 0} (c) [2 marks] Lcfwza : w, r E a, by (d) 12 marks] Ldwwa: w,Ea, by