Let Sigma be the binary alphabet, {0,1}. The canonical order of strings over Sigma is defined as follows: 1. Shorter strings are before longer strings. 2. For strings of the same length, lexical order is used. Thus, the first few strings are: Lambda,0,1,00,01,10,11,000,001,010,011,100,101,110,111,0000,0001, ... If w is any string over Sigma, write w++ to denote the successor of w in the canonical order. Thus, Lambda++ = 0, 1011011++ = 1011100, and 1111++ = 00000, for example. Draw a transition diagram for a Turing machine that computes the successor function. (I can do it with six states.)