AS the 128 byte lines are there and 32 bits( or 4 byte) words are present so,
total no .of words = 128 byte/4byte= 32
it takes 5ns to detect that cache miss has occurrred(given it last line of question)
now first word fetching time is = 100ns
each subsequent word fetching is 10 ns(as 31 words are remaing now ) so = 31*10ns = 310ns
total time = 310 + 100+5 = 415 ns
now this operation is re-executed as cache hit so it takes 5ns more
415+5= 420ns