3) Write a composite Turing machine (you can use any of the elementary machines discussed in class) that accepts the language consisting of all words that contain more a's than b's. The alphabet is {a,b,c} and the precondition is the usual one for language acceptors. Your machine should accept by halting on the leftmost cell of the tape. (So, aabacb and baa are accepted, but the empty string and cacbacbc are not accepted.)

(Edit) The composite diagram is something only my professor seems to use, it is basically a condenses version of a transition diagram that uses shifts and R,L transitions in place of states, a transition diagram would suffice