Cache misses of an array and nested loop ordering

Question

So I have this question from my professor and I could not figure out why vector2 is faster than vector1 and why it has less cache misses than vector1 too. Assume the C code is v