Let V = {000, 001, 010, . . ., 110, 111}. For each four-bit sequence b1b2b3b4 draw an edge from the element b1b2b3 to the element b2b3b4 in V. (a) Draw the graph G = (V, E) as described, (b) Find a directed Euler circuit for G. (c) Equally space eight 0's and eight 1 's around the edge of a rotating (clockwise) drum so that these 16 bits form a circular sequence where the (consecutive) subsequences of length 4 provide the binary representations of 0, 1,2,..., 14, 15 in some order.