i am really stuck on writing the second function computegrey(g) the source file reads in the letter A and B in the file and then goes to the respective function to perform the computation. i understand how to do the n and k function shifting the bits and exclusive or but the g function is being read as an integer and not a string and inside of this function the operation length=(int) log2(g)+1 to convert to decimal. value after exclusive or and stuff as a result in the output. i have been stuck on this function for a while now and any help that could be given would be greatlu appreciated.

i am really lost on this.

this is also being ran in c++ langiage as well.

A. Write a function int computeGrayInt (n, k) to compute & return the integer corresponding to the gray number that appears in position k of the n-bit Gray Code using bit manipulation. There is an easy trick for this one, you do not have to compute all the Gray bit numbers. Instead, shift k right 1 bit than use bit-wise xor on k and the shifted number. For example, n = 3, k= 7 k 111 right shift 011 100 4 This can be done in one line of code. xor B. Write a function int computeGrayPostion (g), that when given a gray code, computes its position k in the n-bit Gray Code. The position k is the base 10 integer representation of the binary code. Use the bit manipulation algorithm above. I will give you hints in class on how to code this. 8 101 100 110 61 pos. 8 1 1 1 1 1 1 1 1 10 1 0 1 0 1 89th position If the line starts with an A, then there will follow 2 integers: number of bits n (1 sn 38) and position ko sk