Mark Exercise 1. (24pts) Find grammars for 2={0, 1) that generate the sets of (a) All strings with exactly one 0. (b) All strings with at least one 1. (c) All strings with no more than two O's. (d) All strings with at least two l's. (e) All strings with at least one substring 01. (t) All strings with exactly one occurrence of the substring 101