Let M be the language of all binary strings that contain the substring 11 and whose number of 0’s is even. (For example, 0101100 is in M.) (a) Give a largest possible set of strings that are pairwise distinguishable with respect to M.(b) Give a largest possible set of strings that are pairwise indistinguishable with respect to M.

You probably find kind your i think

Iposit c as the correct answerbeing a waitress and managing a restaurant can be different jobs in the same care  this is because the difference between the two is attitude. they can be both jobs or careers, if the attitude of the job-doer is that way. on e can be a manger yet sees it a s a job. the job of waitress can also have an impact on future job prospects thus is important for the career line.

What do you mean what does your question mean

G-suit(sweet) for google it allows for them to share and edit projects