3. Consider the language LBitwis-Complement-fa#b | a, b E {0,1)", b-complement(a) (eg if a 010, then b 101)) whose members are comprised of two substrings that are the bitwise-complements of each other separated by a '#' character (e.g. "100#011" or "041", but not "1#10"). Below is the state diagram for a Turing machine that decides this language, but its edges are missing state transitions Complete the diagram by filling in the appropriate transitions of the form "r-t a", L/H', where r, r, are symbols from the tape alphabet {0, 1, #, } . Some edges may have more than one transition You m ay assume that the input string contains exactly one character. (Note: in order to type '#, in BTEX, you need to escape it with a backslash i.e., type"\#1) 92 l 93 Greject 76 94 g5