Design grammars for the following languages:
a) The set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1. !
b) The set of all strings of 0s and 1s that are palindromes; that is, the string reads the same backward as forward. !
c) The set of all strings of 0s and 1s with an equal number of 0s and 1s. !!
d) The set of all strings of 0s and 1s with an unequal number of 0s and 1s. !
e) The set of all strings of 0s and 1s in which 011 does not appear as a substring. !!
f ) The set of all strings of 0s and 1s of the form xy, where x 6= y and x and y are of the same length.