Find a regular expression that defines the language consisting of all words of 0's and 1's with an odd number of 1's.

step-by-step explanation:

given that ab is divided into equal parts as

ac, cd, de, ef, fg, gh, hi, ib.

from this we find that f is the midpoint of ab.

so using mid point formula we find

f = (3,7)

similarly considering fb, we get

h = mid point of fb = ((6,6) and g, mid point of fh is

g = (9/2, 13/2)

i is mid point of hb

so i =(15/2,11/2)