Problem 7) (20 points) Write one assign stament to implement this truth table. No gates or always staments allowed. A B 0 module bitselect (input [2:0] A, input [2:0]B, input [2:0]C, inp ut [7:0]x, output 0); 0 0 O H T O H assign O endmodule 1 x[7] // Only one assign statement allowed for credit. else no credit. 11 x[0] x[1] x[2] x[3] x[4] x[5] x[6]