Given 2 integers, N and K, where N is the number of elements in an array and K is the maximum number of elements that can be traversed each time, what is the minimum \'cost\
