MIPS Prime number factors - mips

Question

I am trying to write a program in MIPS, where you enter a number and it tells you whether it is prime or not, and if it is prime it also gives all the prime numbers up to it. Ex: n = 11, and it will print: "11 is prime, and so are 2, 3, 5, 7, 11". I am not sure how to create the loop to check if numbers before the input are prime and to print or skip over them.
.data
string1: .asciiz "Please enter an integer: "
string2: .asciiz "Input is a prime number"
string3: .asciiz "Input is not a prime number"
string4: .asciiz " "
string5: .asciiz "Prime numbers up to the input are: "
.text
main:
# Print string 1
la $a0, string1
li $v0, 4
syscall
# Take input from user
li $v0, 5
syscall
# Store input in temp register
move $t8, $v0
# Initial value for processing
li $t9, 2
# Corner cases
blt $t8, 1, NotPrime
beq $t8, 1, NotPrime
beq $t8, 2, Prime
loopPrime:
beq $t9, $t8, Prime # Branch to prime when input equals initial value
div $t8, $t9 # Divide input by numbers in range
mfhi $t1 # Move division remainder to t1
beq $t1, $0, NotPrime # If remainder equals 0, the input is not prime number
addi $t9, $t9, 1 # Increment initial value by 1
b loopPrime
Prime:
li $v0, 4
la $a0, string2
syscall
li $v0, 4
la $a0, string4
syscall
li $v0, 4
la $a0, string5
syscall
# Initial value2 for processing
li $t7, 2
b loopfactor2
b Exit
loopfactor1:
addi $t7, $t7,1
b loopfactor2
loopfactor2:
beq $t9, $t7, Print
div $t7, $t9
mfhi $t1
beq $t1, $0, Skip
addi $t9, $t9, 1
blt $t7, $t8 loopfactor1
b Exit
Print:
li $v0, 4
move $a0, $t7
syscall
Skip:
addi $t7, $t7,1
b loopfactor2
NotPrime:
li $v0, 4
la $a0, string3
syscall
b Exit
Exit:
li $v0, 10
syscall