Come up with regular expressions (briefly include your logic) for the following Regular languages. Come up with 3 valid and 3 invalid strings for each of the regular expression.

Strings over the alphabet = {0,1}, where every 1 is followed by at least a 0.

Strings over the alphabet = {a,b}, which starts and ends with same symbol.