How many clock$-$cycles does it take to execute the reordered code on a pipelined processor without forwarding?

Reordered code

lw $t$1,0($$t$0)$

lw $t$2,4($$t$0)$

lw $t$4,8($$t$0)$

add $t$3,$ $t$1,$ $t$2$

add $t$5,$ $t$1,$ $t$4$

$31$:

a$.$

$9$ CCs

b$.$

$10$ CCs

c$.$

$11$ CCs

d$.$

$12$ CCs

e$.$

$13$ CCs

f$.$

$14$ CCs

g$.$

$15$ CCs