3 100 You know that to multiply a binary integer by 16, all you have to do is shift the value over by 4 bit positionswhich in hardware can literally be done without a function unit simply by connecting bus wires such that bit k goes to position k+4 and positions 0-3 are connected to ground. Well, it's harder to multiply by 14. However, by using Booth's algorithm, a single 32-bit add/subtract ALU is sufficient to implement multiply of a 32-bit umber by 14 as a fast combinatorial circuit. Explain how this would be done by giving a formula for X*14 as a C expression (for example, x*s would be (x