In MIPS, 32 zero bits.
Let us write a program that visits every node of a linked list and prints out its data. A visit to every node of a data structure is called a traversal. Here is a start on the program:
The first statement loads register
the address of the first node.
Which instruction should fill the blank in the first statement: