= {a,b,c), demonstrate that A is regular by constructing For the following set of strings A over alphabet an NFA, DFA or a regular expression. A= {wer*(#a(w)) mod 3 = 1} Here, mod is the modulo operation. That is, the number of a's in any string w i.e. #a(w), for every WE A, when divided by 3 would yield a remainder of 1. 1. List out 5 strings in A: 2. Provide an NFA, DFA or a regular expression below