mips assembly code to shift the bit programming : <p>Read in your Student ID and save it to a register, and read in the number “10010000x” as the initial 
    memory address.  Then shift your student ID number to the right one bit at a time, and save it to 
    the memory address which is 4 bytes increment from the previous memory address, until your 
    student ID number is smaller than 1, then save your final student ID number which is NOT smaller 
    than 1, and save the last memory address, and how many iterations to 3 different memory 
    addresses.  Turn in the hardcopy of the MARS graphic printout which has the MIPS Assembly 
    code showing your student ID, and memory addresses and all registers values, and also answer 
    the following three questions on the hard copy paper :<br>
    (1) How many shift right you have to do to get your student ID number to be smaller than 1 ?
    (2) What is your last NOT smaller than 1 binary student id number ? 
    (3) What is the last memory address that saves that last NOT smaller than 1 student ID ? </p>
