Problem $3.(25$ points$)$ In computers, we call it a "shift left" when data moves leftward in the

binary number $($i$.$e$.$ the $1\text{'}$s place goes to the $2\text{'}$s place, the $2\text{'}$s place to the $4\text{'}$s place,

and so on$).$ A "shift right" moves rightward in the binary number. Shifts also differ

on what the shift$-$in value is $($on a shift left, what goes into the rightmost bit

position? On a shift right, what goes into the leftmost bit position?$).$ Computers

have three major types of shifts, based on how they fill that position:

Logical shift $($shift in a $0),$ Arithmetic shift $($compute Val$*2$ for left shift, val$/2$ with sign

extension for right$),$ and Circular shift $($the bit shifted out one side is shifted back in the other

side$).$ Develop a single, $4-$bit shift register that can implement all of these shifts, as well as a

parallel load. Use the following control line settings: