$($iii$)$ Implement a $4-$bit bidirectional shift register and perform the following operations:

Input the initial data of $1101.$

Shift the data to the right twice.

Shift the data to the left once.

Input new data of $1010.$

Shift the data to the right once.

Shift the data to the left twice.

Fill the empty cells in following Table cells for Solution for each task $1.$through $6.$ The first row is already filled.

$\backslash$table$[[$Task$,$Input,Shift,Output$],[1,1101,$XXXX$,1101],[2,,,],[3,,,],[4,,,],[5,,,],[6,,,]]$

Clock