Prove/Disprove whether the languages are regular:

Prove or disprove whether the following languages are regular (b)oo .keNaij>k) Hint: use part (5a) and closure properties. (c) 01i,jEN) (d) { 0i I, i,JE N and j mod 2 } Prove or disprove whether the following languages are regular (b)oo .keNaij>k) Hint: use part (5a) and closure properties. (c) 01i,jEN) (d) { 0i I, i,JE N and j mod 2 }