a.) Generate the binary reflexive Gray code of order 4 by following the algorithm algorithm below

if n=11 return the list {0,1} else recursively generate the list of bit strings of size n-1 make another copy of this list add 0 in front off each bit string in thefirstt list addd 1 in front of each bit string in the second list reverse the order off the second list and append it to the first list

b) Trace the following non-recursive algorithm to generate the binary reflexive Gray code of order 4. Start with the n-bit string of all 0s. For i = 1, 2, ...2ⁿ1, generate the i-th bit string by flipping bit b in the previous bit string, where b is the position of the least significant 1 in the binary representation of i.