An array is to be sorted using insertion sort. Value k (at index i) in the array has 2 inversions with the elements before it and 6 inversions with the elements after it. What is the number of items shifted (using the inner loop of insertion sort) when value k is inserted into the proper place of the sorted sequence in the array during the execution of the insertion sort?