Show each of these languages is regular by designing a regular expression for each language. All languages are over the alphabet sigma = {0, 1}. a) L_1 = {w elementof sigma* | w ends with 1} b) L_2 = {w elementof sigma*| w starts and ends with the same symbol} c) L3 = {w elementof sigma* | w contains at least five 15) d) L_4 = {w elementof sigma*| w contains at most four 0s} e) L_5 = {w elementof sigma* |the length of w is odd} f) L_6 = {w elementof sigma* | the number of 1s in w is not divisible by 3} g) L_7 = {w elementof sigma*|w ends with the substring 110 or 11} h) L_8 = {w elementof sigma* | w contains the substring 1001} i) L_9 = {w elementof sigma* | every third symbol in w is a 1} j) L_10 = {w elementof sigma* | every block of consecutive 0s in w is even in length}