In C++, we might define the following struct: struct node { int val; node *next; // A pointer to the next node in the list char letter; }; Suppose that we have a node in memory, and that $t0 is set to point to this node. Match the following questions with the correct answer: How would we load the node's val into $t1: ✓ [Choose ] lw $t4, 0($t0); addi $t4, $t4, 1; sw $t4, 0($t0) 9 bytes How would we load the node's letter into $t2? 3 bytes lw $t1, val 12 How would we set $t0 to point to the next node in the list? lw $t0,$t0 + next lw $t2, 8($10) How would we increment the node's val? lw $t4, $t0; addi $t4, $t4, 1; sw $t4, $t0 lw $t1,$t0 addi 0($10), 0($t0), 1 lw $t0, 4($10) If we had put node onto the stack, how many bytes would we have used? lb $12, 8($t0) lw $t0, 0($10) lw $t1, 0($10) >