Programming Exercise $3$ :$-$

SHIFTING THE ELEMENTS IN AN ARRAY

Using a loop and indexed addressing, write code that rotates the members of a $32-$bit integer array forward $-$ from lower index elements to upper index

elements $-$ one position; rotating elements in the SAME array, NOT copying elements to a new array with shifted positions. The value at the end of the

array must wrap around to the first position. For example, the array $[10$h$,20$h$,30$h$,40$h$]$ would be rotated to become $[40$h$,10$h $,20$h $,30$h$].$

In the output of the program, the array values both before and after shifting should be shown, by calling the Irvine peripheral procedure$($s$).$

IMPORTANT: for this exercise, NOT allowable to use any one of these directives: $.$IF$,.$ELSE, $.$ELSEIF, $.$WHILE, $.$REPEAT, etc

Please add a lot of comments to explain what's going on$.$ Also, please include Irvine$32$ at the top.