Take the following Gray code on the bitstrings of length 3 and use Knuth's method (shown in class Tuesday) to create a Gray code on the bitstrings of length 4. 010, 011,001,000, 100, 101, 111, 110 Create a factor tree for 150. Make an array where array(1) = 150, the left child of array(n) is in array(2n) and the right child is in array(2n + 1). array(1) = 150 array(2) = _____ array(3) = _____ array(_____) = _____ array(_____) = _____ array(_____) = _____ array(_____) = _____