Please provide me a detailed solution for the problem above, and do not copy past another solution from somewhere else. Thank you.

3. Find a regular expression for the following regular languages (a) {w : 2na(w) + 3n6(w) is even } (b) {w : (na(w) no(w)) mod 3 = 1}