Draw a Turing machine that takes a string representing two unary numbers, x and y, separated by a 0, and determines whether x ≥ y. For example, the input for x = 3, y = 4 would be 11101111. Use two halt states: one for yes and one for no.Give the trace of your machine in the previous problem processing the strings 11101111 and 11110111.