Arithmetic Shift Right

Design a circuit (called ASR) that takes a 4-bit input (A3-A0, where A0 is the least significant bit) and produces a 4-bit output (B3-B0, where B0 is the least significant bit), such that each bit of the input is shifted to the right by one place.

The right-most bit is discarded, and the new left-most bit will be a copy of the old left-most bit.

Note: You should be able to design this circuit directly by drawing it. There should be no need for truth tables, though you can do it that way if you prefer.