Consider the following instructions:

addi $t0, $zero, 15

mystery:
addi $t0, $t0, -5
bne $t0, $zero, mystery

boo:
addi $t0, $t0, 5
beq $t0, $zero, boo
lw $t0, 4($t1)

The above MIPS instructions executed by the 5-stage pipeline datapath with forwarding, with untaken branch prediction, and decision making is moved to
ID stage.

I got this question in a practice and I still don’t fully understand it. How do I find the amount of stalls needed in clock cycles.

I got the total amount of instructions as 10 and the ideal pipeline as 14, but I don’t understand the full concept of stall any help would be appreciated

I’ve been spitballing at this point, I tried just stalling at the branch operations but I just can’t seem to grasp the concept of stall.