Please Write a right-linear CFG for those regular languages: (={0,1}) a. L = { w | w is a binary string which starts and ends with the same symbol} b....

Please Write a right-linear CFG for those regular languages: (∑={0,1})

a. L = { w | w is a binary string which starts and ends with the same symbol}

b. L = { w | w is a binary string with at least three 0's }

c. L = { w | w is a binary string with odd number of 0's and even number of 1's}