Consider the algorithm on page 148 in the textbook for binary reflected Gray codes. What change(s) would you make so that it generates the binary numbers in order for a given length n? Your algorithm must be recursive and keep the same structure as the one in the textbook. Describe only the change(s). (10 points) 1. ALGORITHM BRGC(n) //Generates recursively the binary reflected Gray code of order n /Input: A positive integer n //Output: A list of all bit strings of length n composing the Gray code if n1 make list L containing bit strings 0 and 1 in this order else generate list L1 of bit strings of size 1 by calling BRGC(n -1) copy lst o st 12 in revesed order add 0 in front of each bit string in list L1 add 1 in front of each bit string in list L2 append L2 to L1 to get list L return L