Assume that we expanded the above array to size n with elements of the same pattern

$($where n is a multiple of $4)$ as follows:

$1234123412341234...1234$

What is the exact number of data shifts that insertion sort will perform on the array of size n$?$

Express your answer as a summation.