A register represents numbers in binary. Select the correct method for multiplying the positive integer x, which is stored in this register, by 10. Here, shifting does not result in overflow.

a) Add the value obtained by shifting x three bits to the left and the value obtained by shifting x two bits to the left.

b) Shift x three bits to the left, add x to the value, and then further shift this result one bit to the left.

c) Shift x two bits to the left, add x to the value, and then further shift this result one bit to the left.

d) Shift x two bits to the left, add x to the value, and the further shift this result two bits to the left.