Please do the part b) and explain in words! Thank you!

Find a regular expression that generates each of the following languages over the alphabet (0, 1 and explain in words how your regular expression works. a) {w * | |w| 2 and w starts and ends with the same symbol } b) {w * I every 1 in w is immediately followed by a 0}