please explain detail how to work this code...

Problem 2[20ptsl: The following code calculates the least commo Two inputs are saved in $s0 and $s1 START addi Ssp, $sp, -8 sw $s0, 4(Ssp) sw $s1, 0(Ssp) L1 slt $t0, $s0, $s1 beq ?t0, $zero, L3 ?2 beq $s0, ?zero, FIND sub $s1, $s1, $s0 L1 L3 move $t1, $s0 move $s0, $s1 move $s1, $t1 ?2 FIND: move $s2, $s1 lw $t5, 4(Ssp) lw $t6, 0($sp) addi $sp, $sp, 8 mul $to, $t5, $t6 div St0, $t0, $s2 mflo $t0