Match the following questions, given the digital algorithm explained below:

I. Choose any n bit binary integer, A$,$ where n is any integer from $1$ to $\backslash$infty $.$ Hint: choose a few examples to test with n$<9$

II$.$ Add the binary number $11110110$ to the n bit integer A

III. If a carry bit results from the above Step II addition and thus creates a n$+1$st bit, repeat Step II with just the least significant n bits of the binary addition result as a new and replaced A value that is composed of just n bits.

In other words, extract and leave out the n$+1$st carry bit of $"1"$ where the new A is just the remaining n bits