2. Consider the alphabet = {p,q,!p). (a) Identify each given set in list notation. (1) {wel" : lengthy(w) = 0 } (1) {wes" : tengthyw) = 1} (ii) {wel : length(w) = 2} (b) Consider the function l:I N for which l(w) = length,(w) for each we L*. Indicate whether each given statement is true or false. (i) Dom() = N. (i) (ii) The function & maps I* onto N. (iii) The function is a one-to-one correspondence between S* and N. (iii) (iv) Im(e)+l(*). (iv) (v) For some ne N, there is at most one we L* such that (w,n) e Graph(C). (v)