5 Last Problem Let L C [0, 1] be the language consisting of all bit strings with non-equal number of occurrences of 01 and 10(the empty word is included). Prove that this language is regular and give a regular expression for it. Hint: similar to a problem we treated algebraically in the class! Below are some relevant Eramples of regular expressions: [001) o[01 o f111) is the language of the following words: 001111,001(01)'111, i 2 1. 1. L (0)o {0, l}" {) U ( { o {0, 1}"o { I } ) is the language consisting of all the words with the first letter equal 0 and the last letter equal 1 and all the words with the first and last letters equal 0