ALGORITHM BRGC(n) /Generates recursively the binary reflected Gray code of ordern //Input: A positive integer n /Output: A list of all bit strings of length n composing the Gray code if n 1 make list L containing bit strings 0 and 1 in this order else generate list L1 of bit strings of size n 1 by calling BRGCn 1) copy list L1 to list L2 in reversed 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 Consider the above algorithm 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. Describe only the change(s). ALGORITHM BRGC(n) /Generates recursively the binary reflected Gray code of ordern //Input: A positive integer n /Output: A list of all bit strings of length n composing the Gray code if n 1 make list L containing bit strings 0 and 1 in this order else generate list L1 of bit strings of size n 1 by calling BRGCn 1) copy list L1 to list L2 in reversed 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 Consider the above algorithm 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. Describe only the change(s)