PLease help to do B ii and B iii

B. (8pt) Let 2 = {0,1} and let E = {w w contains unequal number of occurrences of the substrings 01 and 10}. Thus 101 E because 101 contains a single 01 and a single 10, but 1010 E because 1010 contains two 10s and one 01. Note that a E, either. i. (2pt) Show that E is a regular language by giving a regular expression in the form of x(x+x)*x + x(x+x)*x 0(0+1)*1+1(0+1)*0 ii. (3pt) Give the right linear grammar that produces language E. Answer: iii. (3pt) Show that E is a regular language by constructing a 5-state DFA state diagram Include the test for the first 5 accepted strings in the screen shot. Include the test for the first 5 rejected strings in the screen shot. Your machine must pass all the 10 tests to receive the credit